ON INDEPENDENCE NUMBER OF STRONG GENERALIZED CYCLES PRODUCT

Authors

  • S. H. Badalyan Chair of Discrete Mathematics and Theoretical Informatics, YSU, Armenia
  • S. E. Markosyan Chair of Discrete Mathematics and Theoretical Informatics, YSU, Armenia

DOI:

https://doi.org/10.46991/PYSU:A/2010.44.2.035

Keywords:

independence number, cycles product, generalized cycles

Abstract

In the present paper the independence number of generalized cycles product is investigated. A method for constructing the maximal independent set in the product graph is presented. The method is particularly based on a specific combinatorial problem, which is also solved in the paper. The main result generalizes the similar fact known for odd cycles [6].

Downloads

Published

2010-04-26

How to Cite

Badalyan, S. H., & Markosyan, S. E. (2010). ON INDEPENDENCE NUMBER OF STRONG GENERALIZED CYCLES PRODUCT. Proceedings of the YSU A: Physical and Mathematical Sciences, 44(2 (222), 35–40. https://doi.org/10.46991/PYSU:A/2010.44.2.035

Issue

Vol. 44 No. 2 (222) (2010)

Section

Informatics

License

Copyright (c) 2010 Proceedings of the YSU

Creative Commons License

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

Crossref
Scopus
Google Scholar
Europe PMC