✦ LIBER ✦

On graphs whose energy exceeds the number of vertices

✍ Scribed by Ivan Gutman

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 121 KB
Volume: 429
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.09.024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of P-vertices of some grap

On the number of P-vertices of some graphs

✍ Milica Andelić; C.M. da Fonseca; Ricardo Mamede 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Note on unicyclic graphs with given numb

Note on unicyclic graphs with given number of pendent vertices and minimal energy

✍ Bofeng Huo; Shengjin Ji; Xueliang Li 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Unicyclic graphs with given number of pe

Unicyclic graphs with given number of pendent vertices and minimal energy

✍ Hongbo Hua; Maolin Wang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 196 KB

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

Graphs with given odd sets and the least

Graphs with given odd sets and the least number of vertices

✍ Louis Hakimi, S. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 2 views

This note presents a solution to the following problem posed by Chen, Schelp, and Soltés: find a simple graph with the least number of vertices for which only the degrees of the vertices that appear an odd number of times are given.

The total chromatic number of regular gr

The total chromatic number of regular graphs whose complement is bipartite

✍ J.K. Dugdale; A.J.W. Hilton 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 705 KB

We show that a regular graph G of order at least 6 whose complement c is bipartite has total chromatic number d(G) + 1 if and only if (i) G is not a complete graph, and (ii) G#K when n is even. As an aid in"';he proof of this, we also show that , for n>4, if the edges of a Hamiltonian path of Kzn a

The Asymptotic Number of Labeled Graphs

The Asymptotic Number of Labeled Graphs withnVertices,qEdges, and No Isolated Vertices

✍ Edward A Bender; E Rodney Canfield; Brendan D McKay 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 416 KB

Let d(n, q) be the number of labeled graphs with n vertices, q N=( n 2 ) edges, and no isolated vertices. Let x=qÂn and k=2q&n. We determine functions w k t1, a(x), and .(x) such that d(n, q)tw k ( N q ) e n.(x)+a(x) uniformly for all n and q>nÂ2. 1997 Academic Press c(n, q)=u k \ N q + F(x) n A(x)