Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-17T22:22:18.698Z Has data issue: false hasContentIssue false

A GENERAL POSITION PROBLEM IN GRAPH THEORY

Published online by Cambridge University Press:  18 July 2018

PAUL MANUEL*
Affiliation:
Department of Information Science, College of Computing Science and Engineering, Kuwait University, Kuwait email pauldmanuel@gmail.com
SANDI KLAVŽAR
Affiliation:
Faculty of Mathematics and Physics, University of Ljubljana, SloveniaFaculty of Natural Sciences and Mathematics, University of Maribor, SloveniaInstitute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia email sandi.klavzar@fmf.uni-lj.si
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The paper introduces a graph theory variation of the general position problem: given a graph $G$, determine a largest set $S$ of vertices of $G$ such that no three vertices of $S$ lie on a common geodesic. Such a set is a max-gp-set of $G$ and its size is the gp-number $\text{gp}(G)$ of $G$. Upper bounds on $\text{gp}(G)$ in terms of different isometric covers are given and used to determine the gp-number of several classes of graphs. Connections between general position sets and packings are investigated and used to give lower bounds on the gp-number. It is also proved that the general position problem is NP-complete.

Information

Type
Research Article
Copyright
© 2018 Australian Mathematical Publishing Association Inc.