𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Domination Polynomial of a Graph at −1

✍ Scribed by Saeid Alikhani


Book ID
120788753
Publisher
Springer Japan
Year
2012
Tongue
English
Weight
168 KB
Volume
29
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On domination and independent domination
✍ Robert B. Allan; Renu Laskar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 399 KB

For a graph G, the definitions of doknation number, denoted y(G), and independent domination number, denoted i(G), are given, and the following results are obtained: oorollrrg 1. For any graph G, y(L(G)) = i@(G)), where Z,(G) is the line graph of G. (This $xh!s t.lic rtsult ~(L(T))~i(L(T)), h w ere

The cototal domination number of a graph
✍ Kulli, V. R.; Janakiram, B.; Iyer, Radha R. 📂 Article 📅 1999 🏛 Informa UK (Taylor & Francis) 🌐 English ⚖ 271 KB
The Wiener polynomial of a graph
✍ Bruce E. Sagan; Yeong-Nan Yeh; Ping Zhang 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 674 KB

The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the elementary properties of this polynomial and compute it for some