✦ LIBER ✦

Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number

✍ Scribed by Lihua Feng; Aleksandar Ilić

Book ID: 108052547
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 261 KB
Volume: 23
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2010.04.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sharp upper bounds on Zagreb indices of

Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number

✍ Shuchao Li; Qin Zhao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 380 KB

The Zagreb indices of graphs with a give

The Zagreb indices of graphs with a given clique number

✍ Kexiang Xu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Extremal Zagreb Indices of Graphs with a

Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges

✍ Shubo Chen, Weijun Liu 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 517 KB

Wiener indices of trees and monocyclic g

Wiener indices of trees and monocyclic graphs with given bipartition

✍ Zhibin Du 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. It has found various applications in chemical research. We determine the minimum and the maximum Wiener indices of trees with given bipartition and the minimum Wiener in

Minimum sum-connectivity indices of tree

Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number

✍ Zhibin Du; Bo Zhou; Nenad Trinajstić 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 202 KB

Extremal Graphs With a Given Number of P

Extremal Graphs With a Given Number of Perfect Matchings

✍ Stephen G. Hartke; Derrick Stolee; Douglas B. West; Matthew Yancey 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 771 KB