THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH

DOI10.56827/seajmms.2023.1901.19OpenAlexW4381196428MaRDI QIDQ6149009

S. Robinson Chellathurai, Unnamed Author

Publication date: 12 January 2024

Published in: South East Asian J. of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.56827/seajmms.2023.1901.19

zbMATH Keywords

convex domination numberconvex numberforcing convex domination

Mathematics Subject Classification ID

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

Cites Work

• Convexity in graphs
• The convexity number of a graph
• The geodetic number of an oriented graph
• On the forcing domination and the forcing total domination numbers of a graph
• Convex dominating sets in maximal outerplanar graphs
• $H$-convex graphs
• On the geodetic number of a graph
• The Forcing Convexity Number of a Graph
• The forcing nonsplit domination number of a graph
• On the forcing connected domination number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH