Convex Sets in Lexicographic Products of Graphs

Convex Sets in Lexicographic Products of Graphs

Geodesic convex sets, Steiner convex sets, and J -convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies Theorem 3.1 in Canoy and Garces (Graphs Combin 18(4):787–793, 2002 ).

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Graphs and combinatorics 2012, Vol.28 (1), p.77-84
Hauptverfasser: Anand, Bijo S., Changat, Manoj, Klavžar, Sandi, Peterin, Iztok
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorial analysis
Combinatorics
Engineering Design
Geodetics
Graphs
Mathematics
Mathematics and Statistics
Original Paper
Theorems
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Geodesic convex sets, Steiner convex sets, and J -convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies Theorem 3.1 in Canoy and Garces (Graphs Combin 18(4):787–793, 2002 ).
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-011-1031-4