✦ LIBER ✦

Unicyclic and bicyclic graphs having minimum degree distance

✍ Scribed by Alexandru Ioan Tomescu

Book ID: 108112711
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 142 KB
Volume: 156
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.09.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On least distance eigenvalues of trees,

On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs

✍ Lin, Hongying; Zhou, Bo 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Degree Distance of Unicyclic Graphs with

Degree Distance of Unicyclic Graphs with Given Matching Number

✍ Lihua Feng, Weijun Liu, Aleksandar Ilić, Guihai Yu 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 206 KB

Trees, unicyclic graphs and bicyclic gra

Trees, unicyclic graphs and bicyclic graphs with exactly twoQ-main eigenvalues

✍ Chen, Lin; Huang, Qiong Xiang 📂 Article 📅 2013 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 287 KB

Mean distance and minimum degree

✍ Kouider, Mekkia; Winkler, Peter 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

We prove that in a graph of order n and minimum degree d, the mean distance µ must satisfy This asymptotically confirms, and improves, a conjecture of the computer program GRAFFITI. The result is close to optimal; examples show that for any d, µ may be larger than n/(d + 1).

On the eccentric distance sum of trees a

On the eccentric distance sum of trees and unicyclic graphs

✍ Guihai Yu; Lihua Feng; Aleksandar Ilić 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Erratum: Mean distance and minimum degre

Erratum: Mean distance and minimum degree

✍ Kouider, Mekkia; Winkler, Peter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

95-99 mistakenly attributes the computer program GRAFFITI to Fajtlowitz and Waller, instead of just Fajtlowitz. (Our apologies to Siemion Fajtlowitz.) Note also that one of the ''flaws'' we note for Conjecture 62 (that it was made for graphs regular of degree d, vice graphs of minimum degree d) was