๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On domination in connected cubic graphs

โœ Scribed by A.V. Kostochka; B.Y. Stodolsky

Book ID
108113560
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
112 KB
Volume
304
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On weakly connected domination in graphs
On weakly connected domination in graphs
โœ Jean E. Dunbar; Jerrold W. Grossman; Johannes H. Hattingh; Stephen T. Hedetniemi ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 497 KB

A weakly connected dominating set for a connected graph is a dominating set D of vertices of the graph such that the edges not incident to any vertex in D do not separate the graph. This paper considers the weakly connected domination number, 7w, and related domination parameters. It is shown that t

Connected domination critical graphs
Connected domination critical graphs
โœ Xue-Gang Chen; Liang Sun; De-Xiang Ma ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 339 KB
On connected domination in unit ball gra
On connected domination in unit ball graphs
โœ Sergiy Butenko; Sera Kahruman-Anderoglu; Oleksii Ursulenko ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 169 KB
Restrained domination in cubic graphs
Restrained domination in cubic graphs
โœ Johannes H. Hattingh; Ernst J. Joubert ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Springer US ๐ŸŒ English โš– 500 KB
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.