|
|
|
(18.222.37.169)
|
|
Users online: 11866
|
|
|
|
|
|
|
Ijournet
|
|
|
|
|
|
|
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 | |
|
|
|
|
║ Site map
║
Privacy Policy ║ Copyright ║ Terms & Conditions ║
|
|
|
744,604,838 visitor(s) since 30th May, 2005.
|
|
All rights reserved. Site designed and maintained by DIVA ENTERPRISES PVT. LTD..
|
|
Note: Please use Internet Explorer (6.0 or above). Some functionalities may not work in other browsers.
|