✦ LIBER ✦

Note on the energy of regular graphs

✍ Scribed by Xueliang Li; Yiyang Li; Yongtang Shi

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 97 KB
Volume: 432
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.10.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Almost Regular Graphs

✍ M. Of Hofmeister Munich 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

It can easily be seen that a conjecture of RUNGE does not hold for a class of graphs whose members will be called "almost regular". This conjecture is replaced by a weaker one, and a classification of almost regular graphs is given.

A note on regular Ramsey graphs

✍ Noga Alon; Sonny Ben-Shimon; Michael Krivelevich 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB

## Abstract We prove that there is an absolute constant __C__>0 so that for every natural __n__ there exists a triangle‐free __regular__ graph with no independent set of size at least \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle

A note on bipartite subgraphs of triangl

A note on bipartite subgraphs of triangle-free regular graphs

✍ S. C. Locke 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.

A Note on A Family of Directed Strongly

A Note on A Family of Directed Strongly Regular Graphs

✍ Sylvia A. Hobart; T. Justin Shaw 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 54 KB

The distance spectrum and energy of the

The distance spectrum and energy of the compositions of regular graphs

✍ Dragan Stevanović; Gopalapillai Indulal 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 365 KB

The distance energy of a graph G is a recently developed energy-type invariant, defined as the absolute deviation of the eigenvalues of the distance matrix of G. It is a useful molecular descriptor in QSPR modelling, as demonstrated by Consonni and Todeschini in [V. Consonni, R. Todeschini, New spec

On the Circumferences of Regular 2-Conne

On the Circumferences of Regular 2-Connected Graphs

✍ Bing Wei 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Let G be a 2-connected d-regular graph on n rd (r 3) vertices and c(G) denote the circumference of G. Bondy conjectured that c(G) 2nÂ(r&1) if n is large enough. In this paper, we show that c(G) 2nÂ(r&1)+2(r&3)Â(r&1) for any integer r 3. In particular, G is hamiltonian if r=3. This generalizes a resu