The energy of a graph G, denoted by E(G), is defined to be the sum of absolute values of all eigenvalues of the adjacency matrix of G. Let G(n, l, p) denote the set of all unicyclic graphs on n vertices with girth and pendent vertices being l ( 3) and p ( 1), respectively. More recently, one of the
✦ LIBER ✦
A polyhedron of genus 4 with minimal number of vertices and maximal symmetry
✍ Scribed by Jürgen Bokowski; Ulrich Brehm
- Publisher
- Springer
- Year
- 1989
- Tongue
- English
- Weight
- 499 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Unicyclic graphs with given number of pe
✍
Hongbo Hua; Maolin Wang
📂
Article
📅
2007
🏛
Elsevier Science
🌐
English
⚖ 196 KB
A polyhedron with alls—tcuts as vertices
✍
Naveen Garg; Vijay V. Vazirani
📂
Article
📅
1995
🏛
Springer-Verlag
🌐
English
⚖ 561 KB
Note on unicyclic graphs with given numb
✍
Bofeng Huo; Shengjin Ji; Xueliang Li
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 166 KB
Determining minimal cuts with a minimal
✍
Horst Hamacher
📂
Article
📅
1982
🏛
John Wiley and Sons
🌐
English
⚖ 478 KB
On the connection between chromatic numb
✍
B. Andrásfai; P. Erdös; V.T. Sós
📂
Article
📅
1974
🏛
Elsevier Science
🌐
English
⚖ 606 KB
On the number of cycles of length 4 in a
✍
Ahmad Fawzi Alameddine
📂
Article
📅
1980
🏛
John Wiley and Sons
🌐
English
⚖ 148 KB
👁 2 views
## Abstract Let __p__ and __C__~4~ (__G__) be the number of vertices and the number of 4‐cycles of a maximal planar graph __G__, respectively. Hakimi and Schmeichel characterized those graphs __G__ for which __C__~4~ (__G__) = 1/2(__p__^2^ + 3__p__ ‐ 22). This characterization is correct if __p__ ≥