The general position problem and strong resolving graphs
From MaRDI portal
Publication:2278440
DOI10.1515/math-2019-0088zbMath1427.05071arXiv1906.00935OpenAlexW2980330514MaRDI QIDQ2278440
Sandi Klavžar, Ismael González Yero
Publication date: 5 December 2019
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.00935
Related Items (14)
The general position achievement game played on graphs ⋮ The general position number of integer lattices ⋮ Further new results on strong resolving partitions for graphs ⋮ On the general position numbers of maximal outerplane graphs ⋮ The general position avoidance game and hardness of general position games ⋮ The general position number of Cartesian products involving a factor with small diameter ⋮ A Steiner general position problem in graph theory ⋮ On general position sets in Cartesian products ⋮ The general position problem on Kneser graphs and on some graph operations ⋮ On the General Position Number of Complementary Prisms ⋮ THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES ⋮ On the general position number of two classes of graphs ⋮ The edge general position problem ⋮ General d-position sets
Cites Work
- On the strong metric dimension of Cartesian and direct products of graphs
- The strong metric dimension of graphs and digraphs
- Graph derivatives
- Strong resolving graphs: the realization and the characterization problems
- Characterization of general position sets and its applications to cographs and bipartite graphs
- On the geodetic rank of a graph
- The Graph Theory General Position Problem on Some Interconnection Networks
- A new graph product and its spectrum
- A GENERAL POSITION PROBLEM IN GRAPH THEORY
- Unnamed Item
- Unnamed Item
This page was built for publication: The general position problem and strong resolving graphs
