Strong edge geodetic problem in networks
Geodesic covering problems form a widely researched topic in graph theory. One such problem is geodetic problem introduced by Harary et al. [Math. Comput. Modelling, 1993, 17, 89-95]. Here we introduce a variation of the geodetic problem and call it strong edge geodetic problem. We illustrate how th...
Main Authors: | Manuel Paul, Klavžar Sandi, Xavier Antony, Arokiaraj Andrew, Thomas Elizabeth |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2017-10-01
|
Series: | Open Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.1515/math-2017-0101 |
Similar Items
-
Strong Geodetic Problem in Networks
by: Manuel Paul, et al.
Published: (2020-02-01) -
The upper edge geodetic number and the forcing edge geodetic number of a graph
by: A. P. Santhakumaran, et al.
Published: (2009-01-01) -
On the edge geodetic and edge geodetic domination numbers of a graph
by: Vladimir Samodivkin
Published: (2020-06-01) -
The general position problem and strong resolving graphs
by: Klavžar Sandi, et al.
Published: (2019-10-01) -
Solutions of Inverse Geodetic Problem in Navigational Applications
by: Andrzej S. Lenart
Published: (2013-06-01)