✦ LIBER ✦

Inequalities relating domination parameters in cubic graphs

✍ Scribed by Michael A. Henning; Peter J. Slater

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 787 KB
Volume: 158
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(96)00025-8

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

Some remarks on domination in cubic grap

Some remarks on domination in cubic graphs

✍ Bohdan Zelinka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 445 KB

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.

On equality in an upper bound for domina

On equality in an upper bound for domination parameters of graphs

✍ Favaron, O.; Mynhardt, C. M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 2 views

We consider the well-known upper bounds µ(G) ≤ |V (G)|-∆(G), where ∆(G) denotes the maximum degree of G and µ(G) the irredundance, domination or independent domination numbers of G and give necessary and sufficient conditions for equality to hold in each case. We also describe specific classes of gr

Bounds related to domination in graphs w

✍ Sanchis, Laura A. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 2 views

A dominating set for a graph G = (V, E) is a subset of vertices V ⊆ 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). We show that for almost all connected graphs with minimum degree at least 2 and q e