Extremal Edge General Position Sets in Some Graphs

A set of edges X ⊆ E ( G ) of a graph G is an edge general position set if no three edges from X lie on a common shortest path. The edge general position number gp e ( G ) of G is the cardinality of a largest edge general position set in G . Graphs G with gp e ( G ) = | E ( G ) | - 1 and with gp e (...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2024-04, Vol.40 (2), Article 40
Hauptverfasser:	Tian, Jing, Klavžar, Sandi, Tan, Elif
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Engineering Design Graph theory Graphs Lower bounds Mathematics Mathematics and Statistics Original Paper Shortest-path problems
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!