Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
Authors:
- Long WangLWLong Wang
- Chunyu YanCYChunyu Yan
- Xianwen FangXFXianwen Fang
- Xianya GengXGXianya Geng
- Fenglei TianFTFenglei Tian
- 1 December 2020
- journal article
- research article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 607, 307-318
Abstract
No abstract availableKeywords
Funding Information
- Anhui Department of Education
- Natural Science Foundation of Anhui Province
- China Postdoctoral Science Foundation
- National Natural Science Foundation of China
- Natural Science Foundation of Shandong Province
This publication has 17 references indexed in Scilit:
- On the distribution of Laplacian eigenvalues of treesDiscrete Mathematics, 2013
- Nonsingular mixed graphs with few eigenvalues greater than twoEuropean Journal of Combinatorics, 2007
- Sharp lower bounds on the Laplacian eigenvalues of treesLinear Algebra and its Applications, 2004
- The Laplacian Spectrum of a Graph IISIAM Journal on Discrete Mathematics, 1994
- Some eigenvalue properties in graphs (conjectures of Graffiti — II)Discrete Mathematics, 1993
- The Laplacian Spectrum of a GraphSIAM Journal on Matrix Analysis and Applications, 1990
- Eigenvalues of the Laplacian of a graph∗Linear and Multilinear Algebra, 1985
- Permanental roots and the star degree of a graphLinear Algebra and its Applications, 1985
- Graph‐theoretic parameters concerning domination, independence, and irredundanceJournal of Graph Theory, 1979
- Algebraic connectivity of graphsCzechoslovak Mathematical Journal, 1973