The general position number of Cartesian products involving a factor with small diameter
From MaRDI portal
Publication:2242842
DOI10.1016/j.amc.2021.126206OpenAlexW3151487298MaRDI QIDQ2242842
Publication date: 10 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2021.126206
Related Items (16)
The general position achievement game played on graphs ⋮ Maximum number of subtrees in cacti and block graphs ⋮ General position sets in two families of Cartesian product graphs ⋮ Variety of mutual-visibility problems in graphs ⋮ TRAVERSING A GRAPH IN GENERAL POSITION ⋮ Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products ⋮ On the general position numbers of maximal outerplane graphs ⋮ Edge general position sets in Fibonacci and Lucas cubes ⋮ Extremal edge general position sets in some graphs ⋮ The general position avoidance game and hardness of general position games ⋮ General position polynomials ⋮ A Steiner general position problem in graph theory ⋮ On general position sets in Cartesian products ⋮ On the general position number of two classes of graphs ⋮ The edge general position problem ⋮ On the mutual visibility in Cartesian products and triangle-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the no-three-in-line problem on a torus
- Connectivity of Cartesian product graphs
- No-three-in-line-in-3D
- The general position problem on Kneser graphs and on some graph operations
- The general position problem and strong resolving graphs
- Characterization of general position sets and its applications to cographs and bipartite graphs
- Isomorphism between circulants and Cartesian products of cycles
- On the geodetic rank of a graph
- On minimum identifying codes in some Cartesian product graphs
- The general position number of integer lattices
- The Graph Theory General Position Problem on Some Interconnection Networks
- A GENERAL POSITION PROBLEM IN GRAPH THEORY
- On the general position problem on Kneser graphs
- On the General Position Subset Selection Problem
This page was built for publication: The general position number of Cartesian products involving a factor with small diameter