Independent set dominanting sets in bipartite graphs

• Autorzy: Zelinka B.
• Języki publikacji: EN

Abstrakty

EN

The paper continues the study of independent set dominating sets in graphs which was started by E. Sampathkumar. A subset D of the vertex set V(G) of a graph G is called a set dominating set (shortly sd-set) in G, if for each set X ikkeq V(G) - D there exists a set Y ikkeq D such that the subgraph of G induced X cup Y is connected. The minimum number of vertices of an sd-set in G is called the set domination number gammas (G) of G. An sd-set D in G such that /D/ = gammas(G) is called a gammas-set in G. In this paper we study sd-sets in bipartite graphs which are simultaneously independent. We apply the theory of hypergraphs.

Słowa kluczowe

EN

set dominanting set; set domination number; independent set; bipartite graph; multihypergraph

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2005
• Tom: Vol. 25, no. 2
• Strony: 345--349
• Opis fizyczny: Bibliogr. 1 poz.

Twórcy

autor

Zelinka B.

• Technical University of Liberec, Department of Applied Mathematics, Faculty of Education, Czech Republic

Bibliografia

• [1] Sampathkumar E.: Domination parameters of a graph. In: Domination in Graphs, Advanced Tools Haynes T.W., Hedetniemi S. T., Slater P. J. (Eds.), New York, Marcel Dekker Inc. 1998.