Resolving sets for Johnson and Kneser graphs

A set of vertices S in a graph G is a resolving set for G if, for any two vertices u,v, there exists x∈S such that the distances d(u,x)≠d(v,x). In this paper, we consider the Johnson graphs J(n,k) and Kneser graphs K(n,k), and obtain various constructions of resolving sets for these graphs. As well...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of combinatorics 2013-05, Vol.34 (4), p.736-751
Hauptverfasser:	Bailey, Robert F., Cáceres, José, Garijo, Delia, González, Antonio, Márquez, Alberto, Meagher, Karen, Puertas, María Luz
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorial analysis Construction Design engineering Graphs Mathematical analysis Matrices Matrix methods Planes
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!