On Plick Graphs with Point-outercoarseness Number One

Authors

  • V. Lokesha
  • Sunilkumar M Hosamani Rani Channamma University, Belagavi, India
  • Shobha V. Patil

DOI:

https://doi.org/10.29020/nybg.ejpam.v13i5.3716

Keywords:

Plick graph, Edge-disjoint, Nonplanar, Coarseness, Outercoarseness

Abstract

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.

Downloads

Published

2020-12-27

Issue

Section

Special Issue Dedicated to Professor Hari M. Srivastava on the Occasion of his 80th Birthday

How to Cite

On Plick Graphs with Point-outercoarseness Number One. (2020). European Journal of Pure and Applied Mathematics, 13(5), 1300-1305. https://doi.org/10.29020/nybg.ejpam.v13i5.3716

Similar Articles

1-10 of 172

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)