On the Laplacian and signless Laplacian spectrum of a graph with pairwise co-neighbor vertices
✍ Scribed by Nair M.M. Abreu; Domingos M. Cardoso; Enide A. Martins; Maria Robbiano; B. San Martı´n
- Book ID
- 116714110
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 339 KB
- Volume
- 437
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we show that among all the connected graphs with n vertices and k cut vertices, the maximal signless Laplacian spectral radius is attained uniquely at the graph G n,k , where G n,k is obtained from the complete graph K n-k by attaching paths of almost equal lengths to all vertices of
For a (simple) graph G, the signless Laplacian of G is the matrix A(G) + D(G), where A(G) is the adjacency matrix and D(G) is the diagonal matrix of vertex degrees of G; the reduced signless Laplacian of G is the matrix (G) + B(G), where B(G) is the reduced adjacency matrix of G and (G) is the diago