✦ LIBER ✦

On the second largest eigenvalue of line graphs

✍ Scribed by Petrovi?, Miroslav; Mileki?, Bojana

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 169 KB
Volume: 27
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199802)27:2<61::aid-jgt1>3.0.co;2-d

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper all connected line graphs whose second largest eigenvalue does not exceed 1 are characterized. Besides, all minimal line graphs with second largest eigenvalue greater than 1 are determined.

📜 SIMILAR VOLUMES

On line graphs of linear 3-uniform hyper

On line graphs of linear 3-uniform hypergraphs

✍ Metelsky, Yury; Tyshkevich, Regina 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

It is known that the class of line graphs of linear 3-uniform hypergraphs cannot be characterized by a finite list of forbidden induced subgraphs (R. N.

Algorithm for finding one of the largest

Algorithm for finding one of the largest common subgraphs of two three-dimensional graph structures

✍ Sumio Masuda; Hiroyuki Yoshioka; Eiichi Tanaka 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB

Given two connected graphs G a = (V a , E a ) and G b = (V b , E b ) with three-dimensional structures. Let n a = |V a |, m a = |E a |, n b = |V b |, and m b = |E b |. Let the maxi- mum order of a vertex in G a (G b ) be l a (l b ). Initially this paper offers a method to find a largest common subgr

Murder on the Line

✍ John Creasey 📂 Fiction 📅 2014 🏛 House of Stratus 🌐 English ⚖ 140 KB 👁 2 views

Roger 'Handsome' West of Scotland Yard is pitted against a ruthless criminal network. They will stop at nothing in their pursuit of bribery, corruption, and theft. Their target now is the Railway system and amongst them is a cold-blooded killer whom West must capture. Against him is an organisation

On the linear arboricity of planar graph

On the linear arboricity of planar graphs

✍ Wu, Jian-Liang 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. Akiyama, Exoo, and Harary conjectured for any simple graph G with maximum degree ∆. The conjecture has been proved to be true for graphs having ∆ =

Various results on the toughness of grap

Various results on the toughness of graphs

✍ Broersma, Hajo; Engbers, Erik; Trommel, Huib 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB 👁 1 views

Let G be a graph and let t Ն 0 be a real number. Then, We discuss how the toughness of (spanning) subgraphs of G and related graphs depends on (G), we give some sufficient degree conditions implying that (G) Ն t, and we study which subdivisions of 2-connected graphs have minimally 2-tough squares.

On the chromatic number of disk graphs

✍ Malesi?ska, Ewa; Piskorz, Steffen; Wei�enfels, Gerhard 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 1 views

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their