The extended dominating sets in graphs
From MaRDI portal
Publication:6542990
DOI10.1142/s0217595923400158zbMATH Open1545.05163MaRDI QIDQ6542990
Yongtang Shi, Zhipeng Gao, Changqing Xi, Jun Yue
Publication date: 23 May 2024
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On roman, global and restrained domination in graphs
- Relations between packing and covering numbers of a tree
- Making a dominating set of a graph connected
- On the secure domination numbers of maximal outerplanar graphs
- Nordhaus-Gaddum inequalities for domination in graphs
- Domination and outer connected domination in maximal outerplanar graphs
- Distance \(r\)-domination number and \(r\)-independence complexes of graphs
- Partial domination of maximal outerplanar graphs
- Distance domination in graphs with given minimum and maximum degree
- Domination number of graphs with minimum degree five
- On Complementary Graphs
- Distance Domination in Graphs
- DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR
- Domination in planar graphs with small diameter*
- Paths, Stars and the Number Three
- Domination numbers of planar graphs
- Integer linear programming formulations for double roman domination problem
- Topics in Domination in Graphs
This page was built for publication: The extended dominating sets in graphs