The Eigenvalues of a Graph and Its Chromatic Number

DOI10.1112/jlms/s1-42.1.330zbMath0144.45202OpenAlexW2014486909WikidataQ89357618 ScholiaQ89357618MaRDI QIDQ5521316

Publication date: 1967

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-42.1.330

zbMATH Keywords

topology

Related Items (63)

Complementary eigenvalues of graphs ⋮ The index of a periodic graph ⋮ Spectral bounds for the clique and independence numbers of graphs ⋮ A decreasing sequence of upper bounds for the Perron root ⋮ Spectral properties of general hypergraphs ⋮ On the Estrada index conjecture ⋮ The signless Laplacian matrix of hypergraphs ⋮ Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph ⋮ Spectral radii of graphs with given chromatic number ⋮ Bounds on eigenvalues and chromatic numbers ⋮ A homogeneous polynomial associated with general hypergraphs and its applications ⋮ Inequalities for the number of walks in graphs ⋮ Graph Coloring Using Eigenvalue Decomposition ⋮ Unnamed Item ⋮ Technical Note—Revenue Volatility Under Uncertain Network Effects ⋮ The high order spectrum of a graph and its applications in graph colouring and clique counting ⋮ Spectra of uniform hypergraphs ⋮ The signless Laplacian spectral radius of graphs with a prescribed number of edges ⋮ Compact Layered Drawings of General Directed Graphs ⋮ The efficiency and stability of R\&D networks ⋮ New eigenvalue bound for the fractional chromatic number ⋮ On colouring random graphs ⋮ Doubling constants and spectral theory on graphs ⋮ A comparison of bounds for the chromatic number of a graph ⋮ Large regular bipartite graphs with median eigenvalue 1 ⋮ Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution ⋮ On the spectrum of hypergraphs ⋮ Best monotone degree conditions for graph properties: a survey ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ An inequality for the group chromatic number of a graph ⋮ On Laplacian spectra of parametric families of closely connected networks with application to cooperative control ⋮ Distance Laplacian eigenvalues and chromatic number in graphs ⋮ Choice number and energy of graphs ⋮ The edge density of critical digraphs ⋮ Some eigenvalue properties in graphs (conjectures of Graffiti -- II) ⋮ Eigenvalue bounds for the signless \(p\)-Laplacian ⋮ Analytic methods for uniform hypergraphs ⋮ Eigenvalues and colorings of digraphs ⋮ Chromatic number and signless Laplacian spectral radius of graphs ⋮ Chromatic numbers of infinite graphs ⋮ The smallest eigenvalue of the signless Laplacian ⋮ Block linear majorants in quadratic 0--1 optimization ⋮ On the chromatic number of a simplicial complex ⋮ The \(k\)-regular induced subgraph problem ⋮ Graph theory ⋮ Spectral graph theory via higher order eigenvalues and applications to the analysis of random walks ⋮ On the maximum spectral radius of multipartite graphs ⋮ The distance coloring of graphs ⋮ The spectra of multiplicative attribute graphs ⋮ A Cvetković-type theorem for coloring of digraphs ⋮ Chromatic partitions of a graph ⋮ Exact bounds on the order of the maximum clique of a graph. ⋮ A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem ⋮ The largest eigenvalue of a graph: A survey ⋮ An index theory for uniformly locally finite graphs ⋮ A generalization of the Motzkin-Straus theorem to hypergraphs ⋮ Spectral upper bounds on the size of k-regular induced subgraphs ⋮ Colorings in digraphs from the spectral radius ⋮ Ordering graphs with given size by their signless Laplacian spectral radii ⋮ A new kind of Hermitian matrices for digraphs ⋮ NEW UPPER BOUND ON THE LARGEST LAPLACIAN EIGENVALUE OF GRAPHS ⋮ A sharp lower bound for the spectral radius in \(K_4\)-saturated graphs ⋮ Lower bounds of the skew spectral radii and skew energy of oriented graphs

This page was built for publication: The Eigenvalues of a Graph and Its Chromatic Number