The geodetic hop domination number of complementary prisms
From MaRDI portal
Publication:5025156
DOI10.1142/S1793830921500774zbMath1478.05035OpenAlexW3114818452MaRDI QIDQ5025156
No author found.
Publication date: 1 February 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921500774
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
- On the geodetic and hull numbers of shadow graphs
- Domination and total domination in complementary prisms
- On the geodetic and geodetic domination numbers of a graph
- Total restrained geodetic number of graphs
- On the geodetic number of complementary prisms
- Geodetic number of powers of cycles
- The restrained geodetic number of a graph
- Cycles in complementary prisms
- On the geodetic number of a graph
- On the edge monophonic number of a graph
- On the forcing geodetic and forcing Steiner numbers of a graph
- The detour domination number of a graph
- On the (M, D) number of a graph
- The edge geodetic self decomposition number of a graph
- THE FORCING HOP DOMINATION NUMBER OF A GRAPH
- Graphs with large geodetic number
- Edge geodetic self-decomposition in graphs
This page was built for publication: The geodetic hop domination number of complementary prisms