Open AccessOn independent position sets in graphs
Author(s) -
Elias John Thomas,
S. V. Ullas Chandran
Publication year - 2021
Publication title -
proyecciones
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.226
H-Index - 12
eISSN - 0717-6279
pISSN - 0716-0917
DOI - 10.22199/issn.0717-6279-2021-02-0023
Subject(s) - combinatorics , independent set , maximal independent set , mathematics , cartesian product , discrete mathematics , lexicographical order , position (finance) , vertex (graph theory) , chordal graph , graph , 1 planar graph , finance , economics
An independent set S of vertices in a graph G is an independent position set if no three vertices of S lie on a common geodesic. An independent position set of maximum size is an ip-set of G. The cardinality of an ip-set is the independent position number, denoted by ip(G). In this paper, we introduce and study the independent position number of a graph. Certain general properties of these concepts are discussed. Graphs of order n having the independent position number 1 or n − 1 are characterized. Bounds for the independent position number of Cartesian and Lexicographic product graphs are determined and the exact value for Corona product graphs are obtained. Finally, some realization results are proved to show that there is no general relationship between independent position sets and other related graph invariants.