MINIMAL DOUBLY RESOLVING SETS OF ANTIPRISM GRAPHS AND MO¨ BIUS LADDERS

Consider a simple connected graph G = (V(G),E(G)), where V(G) represents the vertex set and E (G) represents the edge set respectively. A subset W of V(G) is called a resolving set for a graph G if for every two distinct vertices x, y ∈ V (G), there exist some vertex w e W such that d(x, w) ≠ d(y, w...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical notes (Miskolci Egyetem (Hungary)) 2022-01, Vol.23 (1), p.457-469
Hauptverfasser:	Sultan, Saba, Bača, Martin, Ahmad, Ali, Imran, Muhammad
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Graph theory Graphs Integers Ladders Vertex sets
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!