Geodetic Global Domination in the Join of Two Graphs

A set S of vertices in a connected graph is called a geodetic set if every vertex not in lies on a shortest path between two vertices from . A set of vertices in is called a dominating set of if every vertex not in has at least one neighbor in . A set is called a geodetic global dominating set of if...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of recent technology and engineering 2020-01, Vol.8 (5), p.4579-4583
Hauptverfasser:	Xaviour, X. Lenin, Chellathurai, S. Robinson
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!