The Clique Covering Number for the Strong Product of Generalized Cycles

Authors

  • Sevak H. Badalyan Yerevan State University

Abstract

In this paper the clique covering number for the strong product of generalized cycles is investigated. A method is given to construct a minimal clique cover in case some conditions hold.

References

M.Rosenfeld, “On a problem of C.E. Shannon in graph theory", Proc. Amer. Math. Soc. 18, 315-319, 1967.

R.S. Hales, “Numerical invariants and the strong product of graphs", Combin. Theory (B) 15, 146-155, 1973.

Downloads

Published

2021-12-10

How to Cite

Badalyan, S. H. . (2021). The Clique Covering Number for the Strong Product of Generalized Cycles. Mathematical Problems of Computer Science, 32, 35–38. Retrieved from http://93.187.165.2/index.php/mpcs/article/view/358

Issue

Vol. 32 (2009): Mathematical Problems of Computer Science

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.