THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH
From MaRDI portal
Publication:6149022
DOI10.56827/seajmms.2023.1901.31MaRDI QIDQ6149022
No author found.
Publication date: 12 January 2024
Published in: South East Asian J. of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Distance in graphs (05C12) 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
- Exact algorithms for dominating set
- The geodetic number of a graph
- A new lower bound on the double domination number of a graph
- On the forcing domination and the forcing total domination numbers of a graph
- The restrained geodetic number of a graph
- A note on the double domination number in trees
- A note on the independent domination number in graphs
- THE GEODETIC DOMINATION NUMBER FOR THE PRODUCT OF GRAPHS
- Graphs with large geodetic number
- Independent transversal dominating sets in graphs: Complexity and structural properties
- Edge geodetic number of a graph