𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simultaneous graph parameters: Factor domination and factor total domination

✍ Scribed by Peter Dankelmann; Michael A. Henning; Wayne Goddard; Renu Laskar

Book ID
108113674
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
174 KB
Volume
306
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Factor domination in graphs
Factor domination in graphs
✍ Robert C. Brigham; Ronald D. Dutton πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 656 KB

Given a factoring of a graph, the factor domination number yr is the smallest number of nodes which dominate all factors. General results, mainly involving bounds on yr for factoring of arbitrary graphs, are presented, and some of these are generalizations of well known relationships. The special c

Domination in a graph with a 2-factor
Domination in a graph with a 2-factor
✍ Ken-ichi Kawarabayashi; Michael D. Plummer; Akira Saito πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 77 KB

## Abstract Let Ξ³(__G__) be the domination number of a graph __G__. Reed 6 proved that every graph __G__ of minimum degree at least three satisfies Ξ³(__G__) ≀ (3/8)|__G__|, and conjectured that a better upper bound can be obtained for cubic graphs. In this paper, we prove that a 2‐edge‐connected cu

Graph-theoretic parameters concerning do
Graph-theoretic parameters concerning domination, independence, and irredundance
✍ B. BollobΓ‘s; E. J. Cockayne πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 402 KB

## Abstract A vertex __x__ in a subset __X__ of vertices of an undericted graph is __redundant__ if its closed neighbourhood is contained in the union of closed neighborhoods of vertices of __X__ – {__x__}. In the context of a communications network, this means that any vertex that may receive comm

Star-factors andk-bounded total dominati
Star-factors andk-bounded total domination
✍ Gunther, Georg; Hartnell, Bert; Rall, Douglas πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 492 KB

In this paper, we consider a variation of total domination in which we limit the ability of a vertex to dominate its neighbors in one of two ways: (a) Every vertex in the dominating set dominates exactly k of its neighbors. Graphs that have such dominating sets are characterized and a recognition al