The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d 3 and n Let C(p) be the caterpillar obtained from the stars S p 1 +1 , S p 2 +1 , . . . , S p d-1 +1
✦ LIBER ✦
Energy of line graphs
✍ Scribed by Ivan Gutman; María Robbiano; Enide Andrade Martins; Domingos M. Cardoso; Luis Medina; Oscar Rojo
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 205 KB
- Volume
- 433
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Line graph eigenvalues and line energy o
✍
Oscar Rojo
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 504 KB
On products and line graphs of signed gr
✍
K.A. Germina; Shahul Hameed K; Thomas Zaslavsky
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 320 KB
Clique-transversal sets of line graphs a
✍
Thomas Andreae; Martin Schughart; Zsolt Tuza
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 704 KB
Andreae, T., M. Schughart and Z. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Mathematics 88 (1991) 11-20. A clique-transversal set T of a graph G is a set of vertices of G such that T meets all maximal cliques of G. The clique-transversal number, denoted t,(
Edge colouring line graphs of unicyclic
✍
Leizhen Cai; John A. Ellis
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 691 KB
Hamiltonian line graphs
✍
Richard A. Brualdi; Robert F. Shanny
📂
Article
📅
1981
🏛
John Wiley and Sons
🌐
English
⚖ 358 KB
## Abstract Sufficient conditions on the degrees of a graph are given in order that its line graph have a hamiltonian cycle.
Interval line graphs
✍
Dale Skrien
📂
Article
📅
1984
🏛
Elsevier Science
🌐
English
⚖ 181 KB