On Plick Graphs with Point-outercoarseness Number One
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 max...
Gespeichert in:
Veröffentlicht in: | European journal of pure and applied mathematics 2021, Vol.13 (5), p.1300-1305 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 1307-5543 1307-5543 |
DOI: | 10.29020/nybg.ejpam.v13i5.3716 |