Strong doubly edge geodetic problem in graphs
Abstract
For a graph G(V(G), E(G), the problem to find a set S ⊆ V(G) where every edge in E(G) is covered by least two fixed geodesics between the vertices in S is called the strong doubly edge geodetic problem and the cardinality of the smallest such S is the strong doubly edge geodetic number of G. In this paper the computational complexity for strong doubly edge geodetic problem is studied and also some bounds for general graphs are derived.
Copyright © 2021 D. Antony Xavier, Deepa Mathew. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
D. A. Xavier, D. Mathew, Strong doubly edge geodetic problem in graphs, J. Math. Comput. Sci. 11 (2021), 5370–5379. https://doi.org/10.28919/jmcs/5489
BibTeX
@article{Xavier2021,
author = {Xavier, D. Antony and Mathew, Deepa},
title = {Strong doubly edge geodetic problem in graphs},
journal = {J. Math. Comput. Sci.},
volume = {11},
year = {2021},
pages = {5370--5379},
doi = {10.28919/jmcs/5489}
}