Full domination in graphs

DOI10.7151/DMGT.1132MaRDI QIDQ2773042zbMATH OpenOpenAlexFDO

Authors Robert Brigham, Gary Chartrand, Ping Zhang, Ronald D. Dutton

Publication date 24 March 2002

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1132

zbMATH Keywords

full closed domination numberfull domination numberfull open domination numberfull star domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

The full domination number of a graph \(G\) is defined as the minimum number of vertices of a full dominating set in \(G\). But a full dominating set in \(G\) is defined not quite clearly. It is only evident that this graph invariant is defined using the domination of a subgraph of \(G\) by a vertex of \(G\). According to the choice of a type of such a subgraph, various types of full dominating sets and full domination numbers are studied. This paper studies the full star domination number, the full closed domination number, and the full open domination number.

Recommendations

• scientific article; zbMATH DE number 1743757
• scientific article; zbMATH DE number 2114682
• Domination in Jahangir graph J_{2,m}
• scientific article; zbMATH DE number 4075103
• scientific article; zbMATH DE number 1539542

Cited in

(1)

• scientific article; zbMATH DE number 1743757 (Why is no real title available?)

This page was built for publication: Full domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2773042)