๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Constructably Laplacian integral graphs
โœ Steve Kirkland ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 229 KB

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,

Indecomposable laplacian integral graphs
โœ Robert Grone; Russell Merris ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 189 KB
On the reduced signless Laplacian spectr
โœ Bit-Shun Tam; Shu-Hui Wu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 314 KB

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

Graphs with maximal signless Laplacian s
โœ Ting-Jung Chang; Bit-Shun Tam ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 340 KB

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

Laplacian integral graphs in S(a, b
โœ Leonardo Silva de Lima; Nair Maria Maia de Abreu; Carla Silva Oliveira; Maria Ag ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB