𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Subgraphs and the Laplacian spectrum of a graph

✍ Scribed by Yasuo Teranishi

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
160 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be a graph and H a subgraph of G. In this paper, a set of pairwise independent subgraphs that are all isomorphic copies of H is called an H-matching. Denoting by Ξ½(H, G) the cardinality of a maximum H-matching in G, we investigate some relations between Ξ½(H, G) and the Laplacian spectrum of G.

πŸ“œ SIMILAR VOLUMES

On the Laplacian Spectrum of (Ξ±, Ο‰) -Gra
On the Laplacian Spectrum of (Ξ±, Ο‰) -Graphs
✍ Alexander Kelmans πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 111 KB

We study the Laplacian spectrum of (Ξ±, Ο‰)-graphs which play an important role in the theory of perfect graphs. The properties of the spectrum we found allow the establishment of some structural properties of (Ξ±, Ο‰)-graphs. We describe, in particular, a class of graphs that are not subgraphs of (Ξ±, Ο‰

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