20.500.12556/DiRROS-18573 Extremal edge general position sets in some graphs A 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. general position set edge general position set cut-vertex diametral path block graphs množica v splošni legi množica povezav v splošni legi prerezno vozlišče premerna pot bločni grafi true false true Angleški jezik Slovenski jezik Neznano 2024-03-27 12:26:29 2024-03-27 12:26:29 2024-03-28 03:33:43 0000-00-00 00:00:00 2024 0 0 11 str. iss. 2, [article no.] 40 Vol. 40 Apr. 2024 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2024-04-01 519.17 0911-0119 10.1007/s00373-024-02770-z 190484739 s00373-024-02770-z.pdf s00373-024-02770-z.pdf 1 AB05096C233328B022052449CDA81563 682d99ccd542986ab4e142d2c42a7e0c61733ad80941d6fb48f043a742266729 cf4f9aaf-ec24-11ee-9dd4-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=25325 https://link.springer.com/article/10.1007/s00373-024-02770-z 1 7a72f81f-ec24-11ee-9dd4-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=25324 Inštitut za matematiko, fiziko in mehaniko 0 0 0