✦ LIBER ✦

The smallest Merrifield–Simmons index of -graphs

✍ Scribed by Hanyuan Deng

Book ID: 104046481
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 753 KB
Volume: 49
Category: Article
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2008.06.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Merrifield–Simmons index in (n,n+ 1)

The Merrifield–Simmons index in (n,n+ 1)-graphs

✍ Hanyuan Deng; Shubo Chen; Jie Zhang 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 248 KB

The Merrifield–Simmons Conjecture Holds

The Merrifield–Simmons Conjecture Holds for Bipartite Graphs

✍ Martin Trinks 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

Graphs with given number of cut vertices

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

✍ Hongbo Hua; Shenggui Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 345 KB

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

The Hosoya indices and Merrifield–Simmon

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

✍ Kexiang Xu; Jianxi Li; Lingping Zhong 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Cacti with the maximum Merrifield–Simmon

Cacti with the maximum Merrifield–Simmons index and given number of cut edges

✍ Maolin Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 286 KB