The Graph Theory General Position Problem on Some Interconnection Networks

DOI10.3233/FI-2018-1748zbMath1407.68367arXiv1710.00244OpenAlexW2963778685WikidataQ128978870 ScholiaQ128978870MaRDI QIDQ3120181

Paul D. Manuel, Sandi Klavžar

Publication date: 1 March 2019

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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

zbMATH Keywords

interconnection networksisometric subgraphgeneral position problemBeneš networksinfinite gridsmonotone-geodesic labeling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (19)

The general position achievement game played on graphs ⋮ The general position number of integer lattices ⋮ Mutual visibility in graphs ⋮ General position sets in two families of Cartesian product graphs ⋮ On the general position numbers of maximal outerplane graphs ⋮ 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 general position sets and its applications to cographs and bipartite 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 Number of Complementary Prisms ⋮ THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES ⋮ The edge general position problem ⋮ On the mutual visibility in Cartesian products and triangle-free graphs ⋮ General d-position sets

This page was built for publication: The Graph Theory General Position Problem on Some Interconnection Networks