| dc.creator | Xaviour, X. Lenin | |
| dc.creator | Chellathurai, S. Robinson | |
| dc.date | 2020-11-12 | |
| dc.date.accessioned | 2021-01-29T12:45:34Z | |
| dc.date.available | 2021-01-29T12:45:34Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3847 | |
| dc.identifier | 10.22199/issn.0717-6279-2020-06-0097 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/163979 | |
| dc.description | 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. | en-US |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Universidad Católica del Norte. | en-US |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3847/3595 | |
| dc.rights | Copyright (c) 2020 X. Lenin Xaviour, S. Robinson Chellathurai | en-US |
| dc.rights | http://creativecommons.org/licenses/by/4.0 | en-US |
| dc.source | Proyecciones (Antofagasta, On line); Vol. 39 No. 6 (2020); 1627-1646 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 39 Núm. 6 (2020); 1627-1646 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2020-06 | |
| dc.subject | Geodetic set | en-US |
| dc.subject | Dominating set | en-US |
| dc.subject | Geodetic domination | en-US |
| dc.subject | Geodetic global domination | en-US |
| dc.subject | Upper geodetic global domination number | en-US |
| dc.subject | 05C12 | en-US |
| dc.subject | Distance in graphs | en-US |
| dc.subject | 05C75 | en-US |
| dc.title | On the upper geodetic global domination number of a graph | en-US |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Peer-reviewed Article | en-US |
| dc.type | text | en-US |
