✦ LIBER ✦

Spectral characterization of graphs with index at most

✍ Scribed by N. Ghareghani; G.R. Omidi; B. Tayfeh-Rezaie

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 140 KB
Volume: 420
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.08.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with Branchwidth at Most Three

✍ Hans L Bodlaender; Dimitrios M Thilikos 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 257 KB

In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph as a

Spectral characterizations of sandglass

Spectral characterizations of sandglass graphs

✍ Pengli Lu; Xiaogang Liu; Zhanting Yuan; Xuerong Yong 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 633 KB

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.

Spectral characterizations of lollipop g

Spectral characterizations of lollipop graphs

✍ Willem H. Haemers; Xiaogang Liu; Yuanping Zhang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 134 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

On a Laplacian spectral characterization

On a Laplacian spectral characterization of graphs of index less than 2

✍ G.R. Omidi 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 129 KB

A graph is said to be determined by the adjacency (respectively, Laplacian) spectrum if there is no other non-isomorphic graph with the same adjacency (respectively, Laplacian) spectrum. The maximum eigenvalue of A(G) is called the index of G. The connected graphs with index less than 2 are known, a

Spectral characterization of some weight

Spectral characterization of some weighted rooted graphs with cliques

✍ Oscar Rojo; Luis Medina 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 349 KB

The level of a vertex in a rooted graph is one more than its distance from the root vertex. A generalized Bethe tree is a rooted tree in which vertices at the same level have the same degree. We characterize completely the eigenvalues of the Laplacian, signless Laplacian and adjacency matrices of a