𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Unoriented Laplacian maximizing graphs are degree maximal

✍ Scribed by Bit-Shun Tam; Yi-Zheng Fan; Jun Zhou

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
256 KB
Volume
429
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the reduced signless Laplacian spectr
On the reduced signless Laplacian spectrum of a degree maximal graph
✍ 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
Graphs with maximal signless Laplacian spectral radius
✍ 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

Iterated line graphs are maximally order
Iterated line graphs are maximally ordered
✍ Martin Knor; L'udovΓ­t Niepel πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 110 KB

## Abstract A graph __G__ is __k__‐ordered if for every ordered sequence of __k__ vertices, there is a cycle in __G__ that encounters the vertices of the sequence in the given order. We prove that if __G__ is a connected graph distinct from a path, then there is a number __t~G~__ such that for ever