On Plick Graphs with Point-outercoarseness Number One
DOI:
https://doi.org/10.29020/nybg.ejpam.v13i5.3716Keywords:
Plick graph, Edge-disjoint, Nonplanar, Coarseness, OutercoarsenessAbstract
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
License
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.
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