Pseudo-Achromatic Number of Honeycomb Derived Networks Umamageswari RM, Arul Sharmila Mary Department of Mathematics, Jeppiaar Engineering College, Chennai, India Online published on 14 October, 2016. Abstract The Pseudo-Achromatic number ψs G of a graph G is the maximum number of colors which may be assigned to the vertices of G so that for every two colors, there exists adjacent vertices to which these colors are assigned (adjacent vertices may have the same color). This paper formulates an O(1)-approximation algorithm for the Pseudo-Achromatic number of honeycomb derived networks. Top Keywords Pseudo-Achromatic number, achromatic number, chromatic number, NP-Completeness. Top |
|
Access denied
Your current subscription does not entitle you to view this content or Abstract is unavailable, the access to full-text of this Article/Journal has been denied. For Information regarding subscription please click here.
For a comprehensive list of other publications available on IJour.net please click here
or, You can subscribe other items from IJour.net (Click here to see other items list.)
Top