On The Independence Number Of Some Strong Products Of Cycle-Powers
In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers α((C102)√3) = 30 and α((C144)√3) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm...
Main Authors: | Jurkiewicz Marcin, Kubale Marek, Ocetkiewicz Krzysztof |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-06-01
|
Series: | Foundations of Computing and Decision Sciences |
Subjects: | |
Online Access: | https://doi.org/10.1515/fcds-2015-0009 |
Similar Items
-
Marcinkiewicz-type strong law of large numbers for double arrays of pairwise independent random variables
by: Dug Hun Hong, et al.
Published: (1999-01-01) -
Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
by: J. Amjadi, et al.
Published: (2015-06-01) -
Characteristics of Shannon’s Information Entropy of Atomic States in Strongly Coupled Plasma
by: Myoung-Jae Lee, et al.
Published: (2020-08-01) -
Strong Equality Between the Roman Domination and Independent Roman Domination Numbers in Trees
by: Chellali Mustapha, et al.
Published: (2013-05-01) -
Domination Number, Independent Domination Number and 2-Independence Number in Trees
by: Dehgardi Nasrin, et al.
Published: (2021-02-01)