✦ LIBER ✦

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

✍ Scribed by Bofeng Huo; Shengjin Ji; Xueliang Li

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 166 KB
Volume: 433
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.05.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

On tricyclic graphs of a given diameter

On tricyclic graphs of a given diameter with minimal energy

✍ Shuchao Li; Xuechao Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 234 KB

On local connectivity of graphs with giv

On local connectivity of graphs with given clique number

✍ Andreas Holtkamp; Lutz Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB

## Abstract For a vertex __v__ of a graph __G__, we denote by __d__(__v__) the __degree__ of __v__. The __local connectivity__ κ(__u, v__) of two vertices __u__ and __v__ in a graph __G__ is the maximum number of internally disjoint __u__ –__v__ paths in __G__, and the __connectivity__ of __G__ is

On the Hosoya index and the Merrifield–S

On the Hosoya index and the Merrifield–Simmons index of graphs with a given clique number

✍ Kexiang Xu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 377 KB

The Hosoya index and the Merrifield-Simmons index of a graph are defined as the total number of the matchings (including the empty edge set) and the total number of the independent vertex sets (including the empty vertex set) of the graph, respectively. Let W n,k be the set of connected graphs with

Note on the reconstruction of infinite g

Note on the reconstruction of infinite graphs with a fixed finite number of components

✍ Thomas Andreae 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 1 views

For every positive integer c , we construct a pair G, , H, of infinite, nonisomorphic graphs both having exactly c components such that G, and H, are hypomorphic, i.e., G, and H, have the same families of vertex-deleted subgraphs. This solves a problem of Bondy and Hemminger. Furthermore, the pair G