Characterization of general position sets and its applications to cographs and bipartite graphs

DOI10.1016/j.amc.2019.04.064zbMath1428.05078arXiv1812.08460OpenAlexW2944343188WikidataQ127897093 ScholiaQ127897093MaRDI QIDQ2279405

Manoj Changat, Elias John Thomas, S. V. Ullas Chandran, Sandi Klavžar, Bijo S. Anand

Publication date: 12 December 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

bipartite graphcographbipartite complementgraph of diameter 2general position set

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (23)

The general position achievement game played on graphs ⋮ The general position number of integer lattices ⋮ Mutual visibility in graphs ⋮ TRAVERSING A GRAPH IN GENERAL POSITION ⋮ On the general position numbers of maximal outerplane graphs ⋮ Some position problems for graphs ⋮ Edge general position sets in Fibonacci and Lucas cubes ⋮ The general position avoidance game and hardness of general position games ⋮ General position polynomials ⋮ The general position number of Cartesian products involving a factor with small diameter ⋮ A Steiner general position problem in graph theory ⋮ The general position problem and strong resolving graphs ⋮ Characterization of classes of graphs with large general position number ⋮ On general position sets in Cartesian products ⋮ The general position problem on Kneser graphs and on some graph operations ⋮ On the general position problem on Kneser graphs ⋮ 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 ⋮ On the mutual visibility in Cartesian products and triangle-free graphs ⋮ General d-position sets ⋮ On independent position sets in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the no-three-in-line problem on a torus
• A family of mixed graphs with large order and diameter 2
• No-three-in-line-in-3D
• Complement reducible graphs
• Embeddings into almost self-centered graphs of given radius
• Multiplicity of eigenvalues of cographs
• Minimum edge cuts in diameter 2 graphs
• On no-three-in-line problem on \(m\)-dimensional torus
• The chromatic symmetric functions of trivially perfect graphs and cographs
• On the complexity of the independent set problem in triangle graphs
• On the geodetic rank of a graph
• The Graph Theory General Position Problem on Some Interconnection Networks
• Finding Points in General Position
• A GENERAL POSITION PROBLEM IN GRAPH THEORY
• ON WIENER INDEX OF GRAPH COMPLEMENTS
• On the General Position Subset Selection Problem

This page was built for publication: Characterization of general position sets and its applications to cographs and bipartite graphs