• Corpus ID: 229331921

On monophonic position sets in graphs

  title={On monophonic position sets in graphs},
  author={Elias John Thomas and S. V. Ullas Chandran and James Tuite and Gabriele Di Stefano},
The general position problem in graph theory asks for the largest set S of vertices of a graph G such that no shortest path of G contains more than two vertices of S . In this paper we consider a variant of the general position problem called the monophonic position problem , obtained by replacing ‘shortest path’ by ‘induced path’. We prove some basic properties and bounds for the monophonic position number of a graph and determine the monophonic position number of some graph families… 

On some extremal position problems for graphs

The general position number of a graph $G$ is the size of the largest set of vertices $S$ such that no geodesic of $G$ contains more than two elements of $S$. The monophonic position number of a

On the General Position Number of Mycielskian Graphs

The general position problem for graphs was inspired by the no-three-in-line problem and the general position subset selection problem from discrete geometry. A set S of vertices of a graph G is a



On monophonic sets in graphs

In this paper we study monophonic sets in a connected graph G. First, we present a realization theorem proving, that there is no general relationship between monophonic and geodetic hull sets.

The general position problem and strong resolving graphs

Abstract The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic. It

The General Position Problem on Kneser Graphs and on Some Graph Operations

The cardinality of a largest general position set of G is the general position number (gp-number) gp(G) of G, and a sharp lower bound on the gp-number is proved for Cartesian products of graphs.

The Graph Theory General Position Problem on Some Interconnection Networks

A Monotone Geodesic Lemma is developed using the Erdos-Szekeres theorem on monotone sequences and the gp-number, the general position number of a graph, is determined for a large class of subgraphs of the infinite grid graph and for the infinite diagonal grid.


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

Algorithmic Aspects of Monophonic Convexity

On the computation of the hull number of a graph

Characterization of classes of graphs with large general position number