On Interval Edge Colorings of Harary Graphs H2n2;2n

Authors

  • Rafayel R. Kamalian Institute for Informatics and Automation Problems of NAS RA
  • Petros A . Petrosyan Institute for Informatics and Automation Problems of NAS RA

Abstract

The problems of existence and construction of interval edge colorings of Harary graphs H2n2;2n are investigated. Bounds are found for the possible number of colors in interval edge colorings of H2n2;2n.

References

F. Harary, Graph Theory, Addison-Wesley, Reading, MA ,1969.

M.N .S. Swamy, K. Thulasiraman, Graphs, Networks and Algorithms, John Wiley & Sons, New York, 1981.

D .B.West, Introduction to Graph Theory, Prentice-Hall, New Jersey, 2001 .

R.R. Kamalian, Interval Edge Colorings of Graphs, Doctoral dissertation, Novosibirsk, 1990.

R.R. Kamalian, P.A .Petrosyan, On lower bound for W(K2n) ,Mathematical Problems of Computer Science, Vol. 23, Yerevan, 2004,pp.127-129.

Downloads

Published

2021-12-10

How to Cite

Kamalian, R. R. ., & Petrosyan, P. A. . . (2021). On Interval Edge Colorings of Harary Graphs H2n2;2n. Mathematical Problems of Computer Science, 24, 86–88. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/589

Issue

Vol. 24 (2005): 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.

Most read articles by the same author(s)