Weakly convex and convex domination numbers

• Autorzy: Lemańska M.
• Języki publikacji: EN

Abstrakty

EN

Two new domination parameters for a connected graph G: the weakly convex domination number of G and the convex domination number of G are introduced. Relations between these parameters and the other domination parameters are derived. In particular, we study for which cubic graphs the convex domination number equals the connected domination number.

Słowa kluczowe

EN

dominating set; connected domination number; distance; isometric set; convex set

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2004
• Tom: Vol. 24, no. 2
• Strony: 181--188
• Opis fizyczny: Bibliogr. 4 poz., rys.

Twórcy

autor

Lemańska M.

• Gdańsk University of Technology, Department of Mathematics, ul. Narutowicza 11/12, 80-952 Gdańsk, Poland,

Bibliografia

• [1] Duchet P., Meyniel E.: On Hadwiger's number and stability number. Annales Discrete Mathematics 13 (1982), 71-74.
• [2] Arumugam S., Paulraj J.: On graphs with equal domination and connected domination numbers. Discrete Mathematics 206 (1999), 45-49.
• [3] Haynes T., Hedetniemi S., Slater P.: Fundamentals of domination in graphs. Marcel Dekker, Inc., 1998.
• [4] Polat N.: On isometric subgraphs of infinite bridged graphs and geodesic convexity. Discrete Mathematics 244 (2002), 399-416.