𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Szeged and the Laplacian Szeged spectrum of a graph

✍ Scribed by Gholam Hossein Fath-Tabar; Tomislav Došlić; Ali Reza Ashrafi

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
171 KB
Volume
433
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subgraphs and the Laplacian spectrum of
Subgraphs and the Laplacian spectrum of a graph
✍ Yasuo Teranishi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 160 KB

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.

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