On the upper geodetic global domination number of a graph
Author
Xaviour, X. Lenin
Chellathurai, S. Robinson
Full text
https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/384710.22199/issn.0717-6279-2020-06-0097
Abstract
A set S of vertices in a connected graph G = (V, E) is called a geodetic set if every vertex not in S lies on a shortest path between two vertices from S. A set D of vertices in G is called a dominating set of G if every vertex not in D has at least one neighbor in D. A set D is called a global dominating set in G if S is a dominating set of both G and Ḡ. A set S is called a geodetic global dominating set of G if S is both geodetic and global dominating set of G. A geodetic global dominating set S in G is called a minimal geodetic global dominating set if no proper subset of S is itself a geodetic global dominating set in G. The maximum cardinality of a minimal geodetic global dominating set in G is the upper geodetic global domination number Ῡg+(G) of G. In this paper, the upper geodetic global domination number of certain connected graphs are determined and some of the general properties are studied. It is proved that for all positive integers a, b, p where 3 ≤ a ≤ b < p, there exists a connected graph G such that Ῡg(G) = a, Ῡg+(G) = b and |V (G)| = p.
Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
The edge-to-edge geodetic domination number of a graph
John, J.; Sujin Flower, V.. Proyecciones (Antofagasta, On line); Vol. 40 No. 3 (2021); 635-658 -
Simulation Dominated Approach versus Video Dominated Approach in Teaching Consecutive Interpreting to Undergraduates: An Exploratory Comparison Study
Li, Xiangdong. Onomázein ; No. 44: 2019; 106-131 -
THE IMPORTANCE OF THE GEODETIC OBSERVATORY TIGO FOR GEOREFERENTIATION
Hase,Hayo. Gayana (Concepción) v.68 n.2 suppl.TIProc 2004