Back to Search
Start Over
Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Source :
-
Linear Algebra & its Applications . May2012, Vol. 436 Issue 9, p3254-3267. 14p. - Publication Year :
- 2012
-
Abstract
- Abstract: Let G be a simple graph, and let the least eigenvalue of the signless Laplacian of the graph G. In this paper we focus on the relations between the least eigenvalue and some parameters reflecting the graph bipartiteness. We introduce two parameters: the vertex bipartiteness and the edge bipartiteness , and show thatWe also define another parameter involved with a cut set, and prove thatwhere is the maximum degree of the graph G. The above two inequalities are very similar in form to those given by Fiedler and Mohar, respectively, with respect to the algebraic connectivity of Laplacian of graphs, which is used to characterize the connectedness of graphs. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 436
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 73529509
- Full Text :
- https://doi.org/10.1016/j.laa.2011.11.015