The geodetic domination number of comb product graphs
<p>A subset <em>S</em> of vertices in graph <em>G</em> is called a <em>geodetic set</em> if every vertex in <em>V</em>(<em>G</em>) \ <em>S</em> lies on a shortest path between two vertices in <em>S</em>. A subs...
Main Authors: | Dimas Agus Fahrudin, Suhadi Wido Saputro |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2020-10-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/1059 |
Similar Items
-
The geodetic domination number for the product of graphs
by: S. Robinson Chellathurai, et al.
Published: (2014-12-01) -
On the edge geodetic and edge geodetic domination numbers of a graph
by: Vladimir Samodivkin
Published: (2020-06-01) -
On Minimal Geodetic Domination in Graphs
by: Nuenay Hearty M., et al.
Published: (2015-08-01) -
On locating-dominating number of comb product graphs
by: Aswan Anggun Pribadi, et al.
Published: (2020-06-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)