Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Conferences
An approximation algorithm for the achromatic number of hex derived networks
B. Rajan
,
Indra Rajasingh
,
S. Mary Arul
,
Varalakshmi
Published in
2011
DOI:
10.1007/978-3-642-25462-8_22
Volume: 253 CCIS
Issue: PART 3
Pages: 253 - 261
Abstract
The achromatic number for a graph G = (V,E) is the largest integer m such that there is a partition of V into disjoint independent sets (V1, ... ,Vm) such that for each pair of distinct sets Vi , Vj , Vi ∪ Vj is not an independent set in G In this paper we present an 0(1)-approximation algorithm to determine the achromatic number of Hex derived networks. © 2011 Springer-Verlag.
Topics:
Disjoint sets
(55)%
55% related to the paper
and
Independent set
(53)%
53% related to the paper
View more info for "
An Approximation Algorithm for the Achromatic Number of Hex Derived Networks
"
Request full-text
Cite
Content may be subject to copyright.
Journal Details
Authors (1)
About the journal
Journal
Communications in Computer and Information Science
ISSN
18650929
Authors (1)
Indra Rajasingh
Mathematics
School of Advanced Sciences
Chennai Campus
Recent publications
Investigating substructures in goal oriented online communities: Case study of Ubuntu IRC
Induced Matching Partition of Petersen and Circulant Graphs
Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
Metric dimension of directed graphs
Get all the updates for this publication
Follow