Skip to main content
SpringerLink
Log in

An Approximation Algorithm for the Achromatic Number of Web Graph

  • Chapter
  • First Online:
Mathematical and Computational Intelligence to Socio-scientific Analytics and Applications

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 518))

  • 131 Accesses

Abstract

Achromatic color labeling is the process of coloring a graph’s vertex such that each pair of distinct colors appears on at least one edge’s extreme points. The achromatic number is the maximum number of colors that can be used to color the entire graph G. We look at the achromatic number of a web graph in terms of computational complexity in this paper, using the O(1) approximation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bodlaender HL (1989) Achromatic number is NP-complete for co-graphs and interval graphs. Inform Proces Lett 31:135–138

    Article  MATH  Google Scholar 

  2. Cairnie N, Edwards KJ (1997) Some results on the achromatic number. J Graph Theory 26:129–136

    Article  MathSciNet  MATH  Google Scholar 

  3. Chaudhary, Vishwanathan S (1997) Approximation algorithms for the achromatic number. ACM, New York, pp 558–563

    Google Scholar 

  4. Chaudhary A, Vishwanathan S (2001) Approximation algorithms for the achromatic number. J Algorithms 41:404–416

    Article  MathSciNet  MATH  Google Scholar 

  5. Edwards KJ (1997) The harmonious chromatic number and the achromatic number. In: Surveys in combinatorics. London, pp 13-47

    Google Scholar 

  6. Farber M, Hahn G, Hell P, Miller DJ (1986) Concerning the achromatic number of graphs. J Combin Theory Ser B 40:21–39

    Article  MathSciNet  MATH  Google Scholar 

  7. Garey MR, Johnson DS (1979) Computers and intractability. Freeman, San Francisco

    MATH  Google Scholar 

  8. Geller DP, Kronk HV (1974) Further results on the achromatic number. Fundam Math 85:285–290

    Article  MathSciNet  MATH  Google Scholar 

  9. Goyal N, Vishwanathan S (2000) A simple proof of NP- completeness of undirected grundy numbering and related problems. Personal Communication

    Google Scholar 

  10. Harary F, Hedetniemi S (1970) The achromatic number of a graph. J Combin Theory 8:154–161

    Article  MathSciNet  MATH  Google Scholar 

  11. Harary F, Hedetniemi S, Prins G (1967) An interpolation theorem for graphical homomorphisms. Portugal Math 26:453–462

    MathSciNet  MATH  Google Scholar 

  12. Hughes F, MacGillivray G (1997) The achromaticnumber of graphs: a survey and some new results. Bull Inst Combin Appl 19:27–56

    MathSciNet  MATH  Google Scholar 

  13. Kortsarz G, Krauthgamer R (2001) On approximating the achromatic number. SIAM J Discret Math 14:408–422

    Article  MathSciNet  MATH  Google Scholar 

  14. Kortsarz G, Shende S (2004) An improved approximation of the achromatic number on bipartite graphs

    Google Scholar 

  15. Manlove D, McDiarmid C (1995) The complexity of harmonious coloring for trees. Discret Appl Math 57:133–144

    Article  MATH  Google Scholar 

  16. MacGillivray G, Rodriguez A (2001) The achromatic number of the union of paths. Discret Math 231:331–335

    Article  MathSciNet  MATH  Google Scholar 

  17. Moukrim A (1999) On the minimum number of processors for scheduling problems with communication delays. Ann Oper Res 86:455–472

    Article  MathSciNet  MATH  Google Scholar 

  18. Roichman Y (2000) On the achromatic number of hypercubes. J Combin Theory Ser B 79:177–182

    Article  MathSciNet  MATH  Google Scholar 

  19. Yannakakis M, Gavril F (1980) Edge dominating sets in graphs. SIAM J Appl Math 38:364–372

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Mathematics, Saveetha School of Engineering, SIMATS, Chennai, Tamil Nadu, India

    Sharmila Mary Arul

Authors
  1. Sharmila Mary Arul
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sharmila Mary Arul .

Editor information

Editors and Affiliations

  1. Department of Mathematics, MNNIT Allahabad, FATER Academy of India, Prayagraj, India

    Pankaj Srivastava

  2. School of Mathematics, Madurai Kamaraj University, Madurai, India

    M. Lellis Thivagar

  3. Department of Mathematics and Computer Science, University of Oradea, Oradea, Romania

    Georgia Irina Oros

  4. Rattanakosin International College of Creative Entrepreneurship, Rajamangala University of Technology, Nakhon Pathom, Thailand

    Chai Ching Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Arul, S.M. (2022). An Approximation Algorithm for the Achromatic Number of Web Graph. In: Srivastava, P., Thivagar, M.L., Oros, G.I., Tan, C.C. (eds) Mathematical and Computational Intelligence to Socio-scientific Analytics and Applications. Lecture Notes in Networks and Systems, vol 518. Springer, Singapore. https://doi.org/10.1007/978-981-19-5181-7_26

Download citation

Publish with us

Policies and ethics

Search

Navigation