Mutharasu, S.; Mohamed, Rilwan N.; Angel, Jebitha M. K.; Tamizh, T. Chelvam On generalized coprime graphs. (English) Zbl 1310.05097 Iran. J. Math. Sci. Inform. 9, No. 2, 1-6 (2014). Summary: Paul Erdős defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal. Cited in 1 Document MSC: 05C15 Coloring of graphs and hypergraphs 05C38 Paths and cycles Keywords:coprime graph; semi-perfect graph; clique number; chromatic number PDFBibTeX XMLCite \textit{S. Mutharasu} et al., Iran. J. Math. Sci. Inform. 9, No. 2, 1--6 (2014; Zbl 1310.05097) Full Text: Link