✦ LIBER ✦

The Merrifield–Simmons Conjecture Holds for Bipartite Graphs

✍ Scribed by Martin Trinks

Book ID: 112121120
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 482 KB
Volume: 72
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21656

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The smallest Merrifield–Simmons index of

The smallest Merrifield–Simmons index of -graphs

✍ Hanyuan Deng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 753 KB

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

A class of graphs for which the ulam con

A class of graphs for which the ulam conjecture holds

✍ F.S. Mulla 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 205 KB

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

Solution to a conjecture on the maximal

Solution to a conjecture on the maximal energy of bipartite bicyclic graphs

✍ Bofeng Huo; Shengjin Ji; Xueliang Li; Yongtang Shi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 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