✦ LIBER ✦

Some remarks on domination in cubic graphs

✍ Scribed by Bohdan Zelinka

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 445 KB
Volume: 158
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00324-c

No coin nor oath required. For personal study only.

✦ Synopsis

We study three recently introduced numerical invariants of graphs, namely, the signed domination number y., the minus domination number 7 and the majority domination number ymaj. An upper bound for ys and lower bounds for ;'-and Y,,~ are found, in terms of the order of the graph.

📜 SIMILAR VOLUMES

Some remarks on domination

✍ D. Archdeacon; J. Ellis-Monaghan; D. Fisher; D. Froncek; P.C.B. Lam; S. Seager; 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 49 KB

## Abstract We prove a conjecture of Favaron et al. that every graph of order __n__ and minimum degree at least three has a total dominating set of size at least __n__/2. We also present several related results about: (1) extentions to graphs of minimum degree two, (2) examining graphs where the bo

Inequalities relating domination paramet

Inequalities relating domination parameters in cubic graphs

✍ Michael A. Henning; Peter J. Slater 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 787 KB

Some remarks on E-minimal graphs

✍ H.P. Yap 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 604 KB

On some conjectures on cubic 3-connected

On some conjectures on cubic 3-connected graphs

✍ Jean-Luc Fouquet; Henri Thuillier 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 969 KB

Our purpose is to consider the following conjectures: Conjecture 1 (Barneffe). . Every cubic 3-connected bipartite planar graph is Hamiltonian. Conjecture 2 (Jaeger). Every cubic cyclically 4-edge connected graph G has a cycle C such that G -V(C) is acyclic. Conjecture 3 (Jackson, Fleischner). Ever

Some remarks on Ádám's conjecture for si

Some remarks on Ádám's conjecture for simple directed graphs

✍ Jozef Jirásek 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 321 KB

On k-domination and minimum degree in gr

On k-domination and minimum degree in graphs

✍ Odile Favaron; Adriana Hansberg; Lutz Volkmann 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract A subset __S__ of vertices of a graph __G__ is __k__‐dominating if every vertex not in __S__ has at least __k__ neighbors in __S__. The __k__‐domination number $\gamma\_k(G)$ is the minimum cardinality of a __k__‐dominating set of __G__. Different upper bounds on $\gamma\_{k}(G)$ are kn