Corpus ID: 229331921

On monophonic position sets in graphs

  title={On monophonic position sets in graphs},
  author={Elias John Thomas and S. Chandran and James Tuite},
A set S of vertices in a graph G is a general position set if no three vertices of S lie on a common geodesic path in G. The size of the largest general position set of G is called the general position number of G, denoted by gp(G). A monophonic path P in G is a path in which any two non-consecutive vertices are not connected by an edge. A set M ⊆ V (G) is a monophonic position set if no three vertices of M lie on a common monophonic path in G. The monophonic position number mp(G) of G is the… Expand
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 graph isExpand


Characterization of general position sets and its applications to cographs and bipartite graphs
It is proved that S⊆V(G) is in general position if and only if the components of G[S] are complete subgraphs, the vertices of which form an in-transitive, distance-constant partition of S. Expand
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.Expand
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. ItExpand
Complexity results related to monophonic convexity
It is proved that the decision problems corresponding to the m-convexity and monophonic numbers are NP-complete, and the size of a minimum subset whose convex hull is equal to V(G) (m-hull number) is described. Expand
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. Expand
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. Expand
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 commonExpand
Algorithmic Aspects of Monophonic Convexity
In this work, the complexity of computing the parameters c m ( G ) , m( G ) and h m (G ) is studied. Expand
On the computation of the hull number of a graph
This work proves that deciding whether hn(G)@?k is NP-complete and presents polynomial-time algorithms for computing hn (G) when G is a unit interval graph, a cograph or a split graph. Expand
Characterization of classes of graphs with large general position number
This paper characterized the classes of all connected graphs of order n with the general position number n-2, which is the largest general position set in graph theory. Expand