𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Hosoya indices and Merrifield–Simmons indices of graphs with connectivity at most

✍ Scribed by Kexiang Xu; Jianxi Li; Lingping Zhong

Book ID
113449294
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
224 KB
Volume
25
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the maximum and minimum Zagreb indice
On the maximum and minimum Zagreb indices of graphs with connectivity at most
✍ Shuchao Li; Haibing Zhou 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 401 KB

a b s t r a c t For a (molecular) graph, the first Zagreb index M 1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M 2 is equal to the sum of the products of degrees of pairs of adjacent vertices. In this paper, we study the Zagreb indices of graphs of order n with

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