On the General Position Number of Complementary Prisms

From MaRDI portal
Publication:4989178

DOI10.3233/FI-2021-2006zbMATH Open1485.05038arXiv2001.02189OpenAlexW3123888514MaRDI QIDQ4989178FDOQ4989178


Authors: S. V. Ullas Chandran, Manoj Changat, Sandi Klavžar, P. K. Neethu Edit this on Wikidata


Publication date: 21 May 2021

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

Abstract: The general position number mgp(G) of a graph G is the cardinality of a largest set of vertices S such that no element of S lies on a geodesic between two other elements of S. The complementary prism GoverlineG of G is the graph formed from the disjoint union of G and its complement overlineG by adding the edges of a perfect matching between them. It is proved that mgp(GoverlineG)len(G)+1 if G is connected and mgp(GoverlineG)len(G) if G is disconnected. Graphs G for which mgp(GoverlineG)=n(G)+1 holds, provided that both G and overlineG are connected, are characterized. A sharp lower bound on mgp(GoverlineG) is proved. If G is a connected bipartite graph or a split graph then mgp(GoverlineG)inn(G),n(G)+1. Connected bipartite graphs and block graphs for which mgp(GoverlineG)=n(G)+1 holds are characterized. A family of block graphs is constructed in which the mgp-number of their complementary prisms is arbitrary smaller than their order.


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




Recommendations




Cites Work


Cited In (13)





This page was built for publication: On the General Position Number of Complementary Prisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989178)