✦ LIBER ✦

Upper total domination versus upper paired-domination

✍ Scribed by Dorbec, Paul; Henning, Michael; McCoy, John

Book ID: 118172365
Publisher: Taylor and Francis Group
Year: 2007
Tongue: English
Weight: 213 KB
Volume: 30
Category: Article
ISSN: 1607-3606
DOI: 10.2989/160736007780205693

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper paired-domination in claw-free gra

Upper paired-domination in claw-free graphs

✍ Paul Dorbec; Michael A. Henning 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 626 KB

Upper bounds on the paired-domination nu

Upper bounds on the paired-domination number

✍ Xue-gang Chen; Wai Chee Shiu; Wai Hong Chan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 199 KB

A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and the subgraph induced by S contains a perfect matching. The minimum cardinality of a paired-dominating set of G is the paireddomination number of G, denoted by γ pr (G). In this w

Upper total domination in claw-free grap

Upper total domination in claw-free graphs

✍ Odile Favaron; Michael A. Henning 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

## Abstract A set __S__ of vertices in a graph __G__ is a total dominating set of __G__ if every vertex of __G__ is adjacent to some vertex in __S__ (other than itself). The maximum cardinality of a minimal total dominating set of __G__ is the upper total domination number of __G__, denoted by Γ~__

Upper signed domination number

✍ Huajun Tang; Yaojun Chen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 132 KB

On the computational complexity of upper

On the computational complexity of upper total domination

✍ Qizhi Fang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Let G = (V; E) be an undirected graph. Upper total domination number t (G) is the maximum cardinality over all minimal total dominating sets of G, and upper fractional total domination number t (G) is the maximum weight over all minimal total dominating functions of G. In this paper we show that: (1

Upper domination and upper irredundance

Upper domination and upper irredundance perfect graphs

✍ Gregory Gutin; Vadim E. Zverovich 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 534 KB

Let /~(G), F(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called In this paper, we present a characterization of F-perfect graphs in terms of a family of forbidden induced subgraphs, and show that the class of F-p