STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS
From MaRDI portal
Publication:5073975
DOI10.17654/NT049010023zbMath1499.05190MaRDI QIDQ5073975
Deepa Mathew, D. Antony Xavier
Publication date: 6 May 2022
Published in: JP Journal of Algebra, Number Theory and Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Strong geodetic problem in grid-like architectures
- Finding a dominating set on bipartite graphs
- On the geodetic and geodetic domination numbers of a graph
- The geodetic number of a graph
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
- Strong geodetic number of graphs and connectivity
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
- Strong geodetic problem in networks
- Strong edge geodetic problem in networks
- On the geodetic number of a graph
- Geodesic Convexity in Graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Dominating Sets in Chordal Graphs
- Strong geodetic problem on Cartesian products of graphs
- Strong geodetic problem on complete multipartite graphs
This page was built for publication: STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS