The restrained geodetic number of a graph
From MaRDI portal
Publication:2350702
DOI10.1007/s40840-014-0068-yzbMath1314.05052OpenAlexW2088964265MaRDI QIDQ2350702
V. Samodivkin, Hossein Abdollahzadeh Ahangar, Seyyed Mahmoud Sheikholeslami, Abdollah Khodkar
Publication date: 25 June 2015
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-014-0068-y
Related Items (13)
The Upper and Forcing Connected Outer Connected Geodetic Numbers of a Graph ⋮ Strong edge geodetic problem in networks ⋮ The restrained double geodetic number of a graph ⋮ THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH ⋮ Total restrained geodetic number of graphs ⋮ RESTRAINED DOUBLE MONOPHONIC NUMBER OF A GRAPH ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The upper restrained Steiner number of a graph ⋮ 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
- The \((a,b)\)-forcing geodetic graphs
- Convexity in graphs
- Defining sets in vertex colorings of graphs and latin rectangles
- On the Steiner, geodetic and hull numbers of graphs
- On the geodetic number of a graph
- The forcing geodetic number of a graph
- Geodetic sets in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The restrained geodetic number of a graph