On the upper geodetic global domination number of a graph
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 gl...
Saved in:
| Main Authors: | , |
|---|---|
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2020
|
| Subjects: | |
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000601627 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|