ON INDEPENDENCE NUMBER OF STRONG GENERALIZED CYCLES PRODUCT

Sevak Badalyan

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

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].

Author(s)

Table of Contents

ON INDEPENDENCE NUMBER OF STRONG GENERALIZED CYCLES PRODUCT

Abstract

Author(s)

Table of Contents

Related Articles

AZIMUTHS RADIATION RISK DEGREE APPRAISAL FOR THE POPULATION LIVING IN AREA OF THE NUCLEAR POWER PLANTS LOCATION

THE KINETICS OF VESICLES SWELLING IN PRESENCE OF TRANSMEMBRANE DIFFERENCE OF POTENTIALS

ON INDEPENDENCE NUMBER OF STRONG GENERALIZED CYCLES PRODUCT

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter