The general position problem on Kneser graphs and on some graph operations
DOI10.7151/dmgt.2269zbMath1468.05057arXiv1903.04286OpenAlexW2995218775WikidataQ126534118 ScholiaQ126534118MaRDI QIDQ2042634
Gregor Rus, Farhad Rahimi Mahid, Hamid Reza Maimani, Sandi Klavžar, Mostafa Momeni, Modjtaba Ghorbani
Publication date: 21 July 2021
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.04286
Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (14)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the no-three-in-line problem on a torus
- No-three-in-line-in-3D
- The super-connectivity of Kneser graphs
- Independence number of products of Kneser graphs
- On no-three-in-line problem on \(m\)-dimensional torus
- On general position sets in Cartesian products
- The general position problem and strong resolving graphs
- Characterization of general position sets and its applications to cographs and bipartite graphs
- On the geodetic rank of a graph
- On the diameter of Kneser graphs
- The Graph Theory General Position Problem on Some Interconnection Networks
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Finding Points in General Position
- A GENERAL POSITION PROBLEM IN GRAPH THEORY
- On the general position problem on Kneser graphs
- On the General Position Subset Selection Problem
- Bipartite Kneser graphs are Hamiltonian
This page was built for publication: The general position problem on Kneser graphs and on some graph operations