✦ LIBER ✦

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

✍ Scribed by Zhibin Du; Bo Zhou; Nenad Trinajstić

Publisher: Springer
Year: 2009
Tongue: English
Weight: 202 KB
Volume: 47
Category: Article
ISSN: 0259-9791
DOI: 10.1007/s10910-009-9604-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Order of a Graph with given Vertex and E

Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree

✍ Mohit Singh; Amitabha Tripathi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 120 KB

A Degree Sum Condition Concerning the Co

A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph

✍ Kenta Ozeki; Tomoki Yamashita 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 200 KB

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will