✦ LIBER ✦

Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs

✍ Scribed by Hong Xing Jiang; Li Ying Kang

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2011
Tongue: English
Weight: 230 KB
Volume: 27
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-011-9057-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nordhaus-Gaddum inequalities for dominat

Nordhaus-Gaddum inequalities for domination in graphs

✍ Frank Harary; Teresa W. Haynes 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 297 KB

A node in a graph G = (V,E) is said to dominate itself and all nodes adjacent to it. A set S C V is a dominating set for G if each node in V is dominated by some node in S and is a double dominating set for G if each node in V is dominated by at least two nodes in S. First we give a brief survey of