On similarity of distances in graphs

A vertex v ∈ V(G) that lies at the same distance from at least two distinct vertices u and w is said to be a distance similar vertex with respect to u and w. A set S ⊂ V(G) of vertices is said to be a distance similar set when each v ∈ S is distance similar to all vertices in V(G) - S. Maximum cardi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Anuradha, A., Swathi, S.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Apexes Graphs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!