Extremal edge general position sets in some graphsTian, Jing (Avtor) Klavžar, Sandi (Avtor) Tan, Elif (Avtor) general position setedge general position setcut-vertexdiametral pathblock graphsA set of edges $X\subseteq 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 ${\rm gp}_{\rm e}(G)$ of $G$ is the cardinality of a largest edge general position set in $G$. Graphs $G$ with ${\rm gp}_{\rm e}(G) = |E(G)| - 1$ and with ${\rm gp}_{\rm e}(G) = 3$ are respectively characterized. Sharp upper and lower bounds on ${\rm gp}_{\rm e}(G)$ are proved for block graphs $G$ and exact values are determined for several specific block graphs.20242024-03-27 12:26:29Neznano18573UDK: 519.17ISSN pri članku: 0911-0119DOI: 10.1007/s00373-024-02770-zCOBISS_ID: 190484739sl