𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Resolution of AutoGraphiX conjectures relating the index and matching number of graphs

✍ Scribed by Dragan Stevanović

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
131 KB
Volume
433
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear Vizing-like relation relating t
A linear Vizing-like relation relating the size and total domination number of a graph
✍ Michael A. Henning 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB

## Abstract We prove that __m__ ≤ Δ (__n__ − γ~t~) for every graph each component of which has order at least 3 of order __n__, size __m__, total domination number γ~t~, and maximum degree Δ ≥ 3. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 285–290, 2005

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