Communications of the Korean Mathematical Society (대한수학회논문집)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

ON CO-WELL COVERED GRAPHS

  • Received : 2019.02.26
  • Accepted : 2019.11.05
  • Published : 2020.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

A graph G is called a well covered graph if every maximal independent set in G is maximum, and co-well covered graph if its complement is a well covered graph. We study some properties of a co-well covered graph and we characterize when the join, the corona product, and cartesian product are co-well covered graphs. Also we characterize when powers of trees and cycles are co-well covered graphs. The line graph of a graph which is co-well covered is also studied.

Keywords

References

  1. G. Agnarsson and R. Greenlaw, Graph Theory: modeling, applications, and algorithms, Pearson Prentice Hall, Upper Saddle River, NJ, 2007.
  2. E. Boros, V. Gurvich, and M. Milanic, On CIS circulants, Discrete Math. 318 (2014), 78-95. https://doi.org/10.1016/j.disc.2013.11.015
  3. J. Brown and R. Hoshino, Well-covered circulant graphs, Discrete Math. 311 (2011), no. 4, 244-251. https://doi.org/10.1016/j.disc.2010.11.007
  4. J. L. Gross and J. Yellen, Handbook of Graph Theory, Discrete Mathematics and its Applications (Boca Raton), CRC Press, Boca Raton, FL, 2004.
  5. M. Lesk, M. D. Plummer, and W. R. Pulleyblank, Equi-matchable graphs, in Graph theory and combinatorics (Cambridge, 1983), 239-254, Academic Press, London, 1984.
  6. M. D. Plummer, Some covering concepts in graphs, J. Combinatorial Theory 8 (1970), 91-98. https://doi.org/10.1016/S0021-9800(70)80011-4
  7. M. D. Plummer, Well-covered graphs: a survey, Quaestiones Math. 16 (1993), no. 3, 253-287. https://doi.org/10.1080/16073606.1993.9631737
  8. G. Ravindra, Well-covered graphs, J. Combin. Inform. System Sci. 2 (1977), no. 1, 20-21.
  9. J. A. W. Staples, On some subclasses of well-covered graphs, J. Graph Theory 3 (1979), no. 2, 197-204. https://doi.org/10.1002/jgt.3190030211
  10. J. Topp and L. Volkmann, On the well-coveredness of products of graphs, Ars Combin. 33 (1992), 199-215.