Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution

DOI10.1016/j.laa.2020.08.011zbMath1458.05159OpenAlexW3049308358MaRDI QIDQ2226407

Yanyan Li

Publication date: 12 February 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2020.08.011

zbMATH Keywords

chromatic numberdomination numbermaximum degreevertex-connectivitydistribution of Laplacian eigenvalue

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Vertex degrees (05C07)

Related Items

Classification of trees by Laplacian eigenvalue distribution and edge covering number ⋮ Classification of graphs by Laplacian eigenvalue distribution and independence number ⋮ Laplacian eigenvalue distribution and graph parameters ⋮ A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the distribution of Laplacian eigenvalues of trees
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• Permanental roots and the star degree of a graph
• Bounds on graph eigenvalues. I
• Domination number and Laplacian eigenvalue distribution
• Graphs with fourth Laplacian eigenvalue less than two
• Sharp lower bounds on the Laplacian eigenvalues of trees
• Nonsingular mixed graphs with few eigenvalues greater than two
• Graph-theoretic parameters concerning domination, independence, and irredundance
• The Laplacian Spectrum of a Graph
• Thekth Laplacian eigenvalue of a tree
• Eigenvalues of the Laplacian of a graph^∗
• The Laplacian Spectrum of a Graph II
• On bipartite graphs with small number of laplacian eigenvalues greater than two and three
• The Eigenvalues of a Graph and Its Chromatic Number
• A relation between the matching number and Laplacian spectrum of a graph