Strongly perfect Plick and Lict graphs for some class of graphs
Downloads
Abstract
A graph G is said to be strongly perfect if each of its induced subgraphs H contains an independent set which
meets all the cliques in H. In this paper, we develop results on strongly perfect graphs for plick and lict graphs of
some class of graphs.
Keywords:
Strongly perfect graph, plick graph, lict graphMathematics Subject Classification:
Mathematics- Pages: 567-572
- Date Published: 01-01-2021
- Vol. 9 No. 01 (2021): Malaya Journal of Matematik (MJM)
C. Berge and P. Duchet, Strongly perfect graphs, NorthHolland Math. Stud., 88 (1984), 57-61.
J. A. Bondy and U. S. R. Murty, Graph Theory, Springer(India) Pvt. Ltd., 2013.
J. A. Gallian, A dynamic survey of graph labeling, Electron. J. Comb., 17 (2018), #DS6.
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass, 1969.
V. R. Kulli and B. Basavanagoud, Characterizations of planar plick graphs, Discuss. Math. Graph Theory, 24(1) (2004), 41-45.
V. R. Kulli and M. H. Muddebihal, Lict and litact graph of graph, J. Appl. Anal. Comput., 2(1) (2006), $33-43$.
G. Ravindra, Meyniel graphs are strongly perfect, $J$. Comb. Theory Ser. B, 33(2) (1982), 187-190.
G. Ravindra, Strongly perfect line graphs and total graphs, in finite and infinite sets, 6-th Hungarian Combinatorial Colloquium, 2 (1984), 621-633.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.
