A parallel algorithm for generating ideal IC-colorings of cycles

Li-Min Liu

Applied Mathematics and Computation, 2015, vol. 250, issue C, 615-627

Abstract: For a given graph G with the vertex set V(G), a coloring f:V(G)→N produces α where α=∑u∈V(H)f(u) for some connected subgraph H of G∑u∈V(H)f(u)=0ifV(H)=∅. The coloring f is an IC-coloring of G if f produces each α∈{0,1,…,S(f)}, where S(f) is the maximum number that can be produced by f. The IC-index M(G) of the graph G is the number maxS(g)|gisanIC-coloringofG. An IC-coloring f is ideal if S(f) is equal to the number of connected subgraph of G. In this paper, a sound and complete parallel algorithm based on the branch and bound technique is proposed to generate ideal IC-colorings of cycles, Cn. Experiments identified 118 ideal IC-colorings of Cn when 2Keywords: IC-coloring; Branch-and-bound; Ideal IC-coloring; IC-index (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314014945
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:250:y:2015:i:c:p:615-627

DOI: 10.1016/j.amc.2014.10.119

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().