Degree maximal graphs are Laplacian integral
โ Scribed by Russell Merris
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 284 KB
- Volume
- 199
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of integers. We consider the class of constructably Laplacian integral graphs -those graphs that be constructed from an empty graph by adding a sequence of edges in such a way that each time a new edge is added,
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
By the signless Laplacian of a (simple) graph G we mean the matrix , where A(G), D(G) denote respectively the adjacency matrix and the diagonal matrix of vertex degrees of G. It is known that connected graphs G that maximize the signless Laplacian spectral radius ฯ(Q (G)) over all connected graphs