Graphs and Combinatorics

, Volume 33, Issue 2, pp 485–487 | Cite as

Coloring the Power Graph of a Semigroup

Original Paper

Abstract

Let G be a semigroup. The vertices of the power graph \({\mathcal {P}}(G)\) are the elements of G, and two elements are adjacent if and only if one of them is a power of the other. We show that the chromatic number of \({\mathcal {P}}(G)\) is at most countable, answering a recent question of Aalipour et al.

Keywords

Power graph Chromatic number 

Mathematics Subject Classification

05C15 20F99 

References

  1. 1.
    Aalipour, G., Akbari, S., Cameron, P.J., Nikandish, R., Shaveisi, F.: On the structure of the power graph and the enhanced power graph of a group. (2016) (preprint ) arXiv:1603.04337
  2. 2.
    Cameron, P.J.: The power graph of a finite group, II. J. Group Theory 13, 779–783 (2010)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Cameron, P.J., Ghosh, S.: The power graph of a finite group. Discrete Math. 311, 1220–1222 (2011)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Fodor, G.: Proof of a conjecture of P. Erdős. Acta Sci. Math. Hung 14, 219–227 (1952)MathSciNetMATHGoogle Scholar
  5. 5.
    Komjáth, P.: A note on uncountable chordal graphs. Discrete Math. 338, 1565–1566 (2015)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Japan 2017

Authors and Affiliations

  1. 1.National Research University Higher School of EconomicsMoscowRussia

Personalised recommendations