The forcing near geodetic number of a graph
From MaRDI portal
Publication:4965896
DOI10.1142/S1793830920500299zbMATH Open1456.05047OpenAlexW3003196049MaRDI QIDQ4965896FDOQ4965896
Authors: R. Lenin
Publication date: 18 March 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830920500299
Recommendations
Cites Work
- Title not available (Why is that?)
- On the geodetic number of a graph
- The forcing geodetic number of a graph
- Title not available (Why is that?)
- The geodetic number of a graph
- Geodetic sets in graphs
- Title not available (Why is that?)
- Geodomination in graphs
- The upper connected geodetic number and forcing connected geodetic number of a graph
- The forcing hull and forcing geodetic numbers of graphs
- On the forcing geodetic and forcing steiner numbers of a graph
- Edge geodetic number of a graph
- The near geodetic number of a graph
Cited In (6)
- Title not available (Why is that?)
- The \((a,b)\)-forcing geodetic graphs
- The upper connected geodetic number and forcing connected geodetic number of a graph
- The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity
- On the forcing geodetic and forcing steiner numbers of a graph
- THE FORCING HOP DOMINATION NUMBER OF A GRAPH
This page was built for publication: The forcing near geodetic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965896)