The Geodesic Irredundant Sets in Graphs

For two vertices u and v of a connected graph G, the set I[u,v] consists of all those vertices lying on u - v geodesics in G. Given a set S of vertices of G, the union of all sets I[u,v] for u,v ∈ S is denoted by I[S]. A convex set S satisfies I[S] = S. The convex hull [S] of S is the smallest conve...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of mathematical combinatorics 2016-12, Vol.4, p.135
Hauptverfasser:	Chandran, S V Ullas, Parthasarathy, G Jaya
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Geodesy Graph theory Graphs Integers Mathematics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!