✦ LIBER ✦

Connected graphs with maximal Q-index: The one-dominating-vertex case

✍ Scribed by Ting-Chung Chang; Bit-Shun Tam

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 247 KB
Volume: 435
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.02.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the extremal graphs with respect to t

On the extremal graphs with respect to the vertex PI index

✍ Aleksandar Ilić 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Some results on characterizing the edges

Some results on characterizing the edges of connected graphs with a given domination number

✍ Laura A. Sanchis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 821 KB

A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v • V-V' there exists some u• V' for which {v,u} •E. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu