✦ LIBER ✦

Spectral characterizations of sandglass graphs

✍ Scribed by Pengli Lu; Xiaogang Liu; Zhanting Yuan; Xuerong Yong

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 633 KB
Volume: 22
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2009.01.050

No coin nor oath required. For personal study only.

✦ Synopsis

The sandglass graph is obtained by appending a triangle to each pendant vertex of a path. It is proved that sandglass graphs are determined by their adjacency spectra as well as their Laplacian spectra.

📜 SIMILAR VOLUMES

Spectral characterizations of lollipop g

Spectral characterizations of lollipop graphs

✍ Willem H. Haemers; Xiaogang Liu; Yuanping Zhang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 134 KB

On spectral characterizations and embedd

On spectral characterizations and embeddings of graphs

✍ Michael Doob; Dragoš Cvetković 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 596 KB

Two spectral characterizations of regula

Two spectral characterizations of regular, bipartite graphs with five eigenvalues

✍ Dragan Stevanović 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 650 KB

Spectral characterization of the Hamming

Spectral characterization of the Hamming graphs

✍ Sejeong Bang; Edwin R. van Dam; Jack H. Koolen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 123 KB

Characterizations of signed graphs

✍ Thomas Zaslavsky 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB

## Abstract The possible classes of balanced circles of a signed graph are characterized in two ways.

Characterizations of outerplanar graphs

✍ Maciej M. Sysło 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 750 KB

The paper presents several characterizations of outerp:anar graphs, some of them are counterparts of the well-known characterizations of planar graphs and the other provide very efficient tools for outerplanarity testing, coding (i.e. isomorphism testing), and counting such graphs. Finally, we attem