𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs with given number of cut vertices and extremal Merrifield–Simmons index

✍ Scribed by Hongbo Hua; Shenggui Zhang

Book ID
108112928
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
345 KB
Volume
159
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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.