The Eigenvalues of a Graph and Its Chromatic Number
From MaRDI portal
Cited in
(71)- An index theory for uniformly locally finite graphs
- A generalization of the Motzkin-Straus theorem to hypergraphs
- Spectral bounds for the clique and independence numbers of graphs
- A comparison of bounds for the chromatic number of a graph
- The symbiotic relationship of combinatorics and matrix theory
- Chromatic numbers of infinite graphs
- Chromatic partitions of a graph
- The index of a periodic graph
- A decreasing sequence of upper bounds for the Perron root
- Bounds on eigenvalues and chromatic numbers
- Spectral properties of general hypergraphs
- Eigenvalue bounds for the signless \(p\)-Laplacian
- The k-regular induced subgraph problem
- Exact bounds on the order of the maximum clique of a graph.
- A Cvetković-type theorem for coloring of digraphs
- Colorings in digraphs from the spectral radius
- Ordering graphs with given size by their signless Laplacian spectral radii
- A sharp lower bound for the spectral radius in \(K_4\)-saturated graphs
- The signless Laplacian matrix of hypergraphs
- A homogeneous polynomial associated with general hypergraphs and its applications
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
- On the spectrum of hypergraphs
- Analytic methods for uniform hypergraphs
- A new kind of Hermitian matrices for digraphs
- Lower bounds of the skew spectral radii and skew energy of oriented graphs
- Complementary eigenvalues of graphs
- An inequality for the group chromatic number of a graph
- Doubling constants and spectral theory on graphs
- Spectral upper bounds on the size of k-regular induced subgraphs
- Schrödinger operators with - and '-interactions on Lipschitz surfaces and chromatic numbers of associated partitions
- Compact layered drawings of general directed graphs
- Graph Coloring Using Eigenvalue Decomposition
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
- Inequalities for the number of walks in graphs
- scientific article; zbMATH DE number 3683613 (Why is no real title available?)
- On colouring random graphs
- Spectra of uniform hypergraphs
- The efficiency and stability of R\&D networks
- The largest eigenvalue of a graph: A survey
- Best monotone degree conditions for graph properties: a survey
- On the maximum spectral radius of multipartite graphs
- New upper bound on the largest Laplacian eigenvalue of graphs
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
- Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph
- Chromatic number and signless Laplacian spectral radius of graphs
- Technical note -- Revenue volatility under uncertain network effects
- Distance Laplacian eigenvalues and chromatic number in graphs
- The edge density of critical digraphs
- The smallest eigenvalue of the signless Laplacian
- Graph theory
- Spectral graph theory via higher order eigenvalues and applications to the analysis of random walks
- The high order spectrum of a graph and its applications in graph colouring and clique counting
- New eigenvalue bound for the fractional chromatic number
- Inverse of Hermitian adjacency matrix of mixed bipartite graphs
- Spectral upper bounds for the Grundy number of a graph
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Random independent sets in triangle-free graphs
- r-dynamic colorings and the spectral radius in graphs
- Eigenvalue locations of complex matrices and its applications
- On the epidemic threshold of a network
- Block linear majorants in quadratic 0--1 optimization
- On the chromatic number of a simplicial complex
- Eigenvalue bounds for distance-edge colourings
- Proof of a conjectured spectral upper bound on the chromatic number of a graph
- The distance coloring of graphs
- The spectra of multiplicative attribute graphs
- On the Estrada index conjecture
- Spectral radii of graphs with given chromatic number
- Choice number and energy of graphs
- Eigenvalues and colorings of digraphs
This page was built for publication: The Eigenvalues of a Graph and Its Chromatic Number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5521316)