✦ LIBER ✦

Some new results on domination roots of a graph

✍ Scribed by Alikhani, Saeid

Book ID: 121811480
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 246 KB
Volume: 43
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.07.062

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some results on domination number of pro

Some results on domination number of products of graphs

✍ Shan Erfang; Sun Liang; Kang Liying 📂 Article 📅 1998 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 224 KB

Reviewing some Results on Fair Dominatio

Reviewing some Results on Fair Domination in Graphs

✍ Hansberg, Adriana 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 178 KB

New results on 3-domination critical gra

New results on 3-domination critical graphs

✍ Camino Balbuena, Adriana Hansberg 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 274 KB

On domination and independent domination

On domination and independent domination numbers of a graph

✍ 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

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

On the domination number of some graphs

✍ Kazemi, Adel P. 📂 Article 📅 2009 🏛 Informa UK (Taylor & Francis) 🌐 English ⚖ 174 KB