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
Publication date: 4 April 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Abstract: A set of edges of a graph is an edge general position set if no three edges from lie on a common shortest path. The edge general position number of is the cardinality of a largest edge general position set in . Graphs with and with are respectively characterized. Sharp upper and lower bounds on are proved for block graphs and exact values are determined for several specific block graphs.
Full work available at URL: https://arxiv.org/abs/2302.01587
Recommendations
Cites Work
- On the extremal combinatorics of the Hamming space
- On general position sets in Cartesian products
- The general position number of Cartesian products involving a factor with small diameter
- A general position problem in graph theory
- On the general position problem on Kneser graphs
- The semitotal domination problem in block graphs
- On the general position number of two classes of graphs
- The edge general position problem
- Maximum number of subtrees in cacti and block graphs
- General position sets in two families of Cartesian product graphs
- TRAVERSING A GRAPH IN GENERAL POSITION
- On the general position numbers of maximal outerplane graphs
- Edge general position sets in Fibonacci and Lucas cubes
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)