Extremal edge general position sets in some graphs

From MaRDI portal
Publication:6131296

DOI10.1007/S00373-024-02770-ZarXiv2302.01587OpenAlexW4393192741MaRDI QIDQ6131296FDOQ6131296


Authors: Jing Tian, Sandi Klavžar, Elif Tan Edit this on Wikidata


Publication date: 4 April 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: A set of edges XsubseteqE(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 mgpme(G) of G is the cardinality of a largest edge general position set in G. Graphs G with mgpme(G)=|E(G)|1 and with mgpme(G)=3 are respectively characterized. Sharp upper and lower bounds on mgpme(G) are proved for block graphs G and exact values are determined for several specific block graphs.


Full work available at URL: https://arxiv.org/abs/2302.01587




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Extremal edge general position sets in some graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131296)