✦ LIBER ✦

Sharp Bounds for the Second Zagreb Index of Unicyclic Graphs

✍ Scribed by Zheng Yan; Huiqing Liu; Heguo Liu

Publisher: Springer
Year: 2006
Tongue: English
Weight: 135 KB
Volume: 42
Category: Article
ISSN: 0259-9791
DOI: 10.1007/s10910-006-9132-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sharp bounds for Zagreb indices of maxim

Sharp bounds for Zagreb indices of maximal outerplanar graphs

✍ Ailin Hou; Shuchao Li; Lanzhen Song; Bing Wei 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 657 KB

On sharp bounds of the zero-order Randić

On sharp bounds of the zero-order Randić index of certain unicyclic graphs

✍ Anhua Lin; Rong Luo; Xiaoya Zha 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Sharp bounds on the zeroth-order general

Sharp bounds on the zeroth-order general Randić index of unicyclic graphs with given diameter

✍ Xiang-Feng Pan; Huiqing Liu; Meimei Liu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Sharp upper bounds for Zagreb indices of

Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter

✍ Shuchao Li; Minjie Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 255 KB

For a (molecular) graph, the first Zagreb index M 1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M 2 is equal to the sum of products of the degrees of a pair of adjacent vertices. In this work, we study the Zagreb indices of bipartite graphs of order n with diame

On bounds for the index of double nested

On bounds for the index of double nested graphs

✍ M. Andelić; C.M. da Fonseca; S.K. Simić; D.V. Tošić 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 262 KB

Improved bounds for the chromatic index

Improved bounds for the chromatic index of graphs and multigraphs

✍ Hakimi, S. Louis; Schmeichel, Edward F. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB 👁 2 views

We show that coloring the edges of a multigraph G in a particular order often leads to improved upper bounds for the chromatic index χ (G). Applying this to simple graphs, we significantly generalize recent conditions based on the core of G (i.e., the subgraph of G induced by the vertices of degree