On General Position Sets in Cartesian Products

The general position number gp ( G ) of a connected graph G is the cardinality of a largest set S of vertices such that no three distinct vertices from S lie on a common geodesic; such sets are refereed to as gp-sets of G . The general position number of cylinders P r □ C s is deduced. It is proved...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Resultate der Mathematik Jg. 76; H. 3
Hauptverfasser: Klavžar, Sandi, Patkós, Balázs, Rus, Gregor, Yero, Ismael G.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cham Springer International Publishing 01.08.2021
Schlagworte:
Mathematics
Mathematics and Statistics
05C76
probabilistic constructions
05C12
05C30
05D40
General position problem
paths and cycles
Cartesian product of graphs
exact enumeration
ISSN:1422-6383, 1420-9012
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The general position number gp ( G ) of a connected graph G is the cardinality of a largest set S of vertices such that no three distinct vertices from S lie on a common geodesic; such sets are refereed to as gp-sets of G . The general position number of cylinders P r □ C s is deduced. It is proved that gp ( C r □ C s ) ∈ { 6 , 7 } whenever r ≥ s ≥ 3 , s ≠ 4 , and r ≥ 6 . A probabilistic lower bound on the general position number of Cartesian graph powers is achieved. Along the way a formula for the number of gp-sets in P r □ P s , where r , s ≥ 2 , is also determined.
ISSN:1422-6383
1420-9012
DOI:10.1007/s00025-021-01438-x