E-viri
Recenzirano
Odprti dostop
-
Tian, Jing; Klavžar, Sandi; Tan, Elif
Graphs and combinatorics, 04/2024, Letnik: 40, Številka: 2Journal Article
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 ( G ) = 3 are respectively characterized. Sharp upper and lower bounds on gp e ( G ) are proved for block graphs G and exact values are determined for several specific block graphs.
