Open AccessOn Plick Graphs with Point-outercoarseness Number One
Author(s) -
V. Lokesha,
Sunilkumar M. Hosamani,
Shobha V. Patil
Publication year - 2020
Publication title -
european journal of pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.245
H-Index - 5
ISSN - 1307-5543
DOI - 10.29020/nybg.ejpam.v13i5.3716
Subject(s) - mathematics , combinatorics , line graph , discrete mathematics , block graph , graph power , graph , vertex (graph theory) , complement graph , windmill graph , pathwidth
The plick graph P(G) of a graph G is obtained from the line graph by adding a new vertex corresponding to each block of the original graph and joining this vertex to the vertices of the line graph which correspond to the edges of the block of the original graph. The point outer-coarseness is the maximum number of vertex-disjoint nonouterplanar subgraphs of G. In this paper, we obtain a necessary and sufficient conditions for the plick graph P(G) to have pointoutercoarseness number one.