Total restrained geodetic number of graphs
From MaRDI portal
Publication:1696108
DOI10.1007/s40995-017-0158-4zbMath1380.05044OpenAlexW2607278467MaRDI QIDQ1696108
M. Najimi, Hossein Abdollahzadeh Ahangar
Publication date: 14 February 2018
Published in: Iranian Journal of Science and Technology. Transaction A: Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40995-017-0158-4
Related Items (7)
The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Restrained geodetic domination in graphs ⋮ Graphs with large total geodetic number ⋮ The geodetic hop domination number of complementary prisms ⋮ Distinct edge geodetic decomposition in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on the geodetic number of a graph
- The upper connected geodetic number and forcing connected geodetic number of a graph
- Convexity in graphs
- The restrained geodetic number of a graph
- Graphs with specified radius and diameter
- On the geodetic number of a graph
- Geodetic sets in graphs
- Computational Complexity of Geodetic Set
- Extreme Geodesic Graphs
- Graphs with large geodetic number
This page was built for publication: Total restrained geodetic number of graphs