✦ LIBER ✦

Extremal energies of trees with a given domination number

✍ Scribed by Kexiang Xu; Lihua Feng

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing the Laplacian eigenvalues for

Minimizing the Laplacian eigenvalues for trees with given domination number

✍ Lihua Feng; Guihai Yu; Qiao Li 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 160 KB

Maximum number of edges in connected gra

Maximum number of edges in connected graphs with a given domination number

✍ Laura A. Sanchis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Sanchis, L.A., Maximum number of edges in connected graphs with a given domination number, Discrete Mathematics 87 (1991) 65-72.

Graphs with an extremal number of spanni

Graphs with an extremal number of spanning trees

✍ A. K. Kelmans 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

On the spectral radius of graphs with a

On the spectral radius of graphs with a given domination number

✍ Dragan Stevanović; Mustapha Aouchiche; Pierre Hansen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 202 KB

On the independent domination number of

On the independent domination number of graphs with given minimum degree

✍ N.I. Glebov; A.V. Kostochka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 175 KB

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case 6 = 2 of the corresponding conjecture by Favaron (1988). @ 1998 Elsevier Science B.V. A

A certain polynomial of a graph and grap

A certain polynomial of a graph and graphs with an extremal number of trees

✍ A.K Kelmans; V.M Chelnokov 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 760 KB