Some Properties of Mobius Function Graph M(−1) in Graphs

Authors

Sanaa K. Al-Asadi, Department of Mathematics, College of Education for Pure Science, University of Babylon, Babylon, IraqFollow
Ahmed A. Omran, Department of Mathematics, College of Education for Pure Science, University of Babylon, Babylon, IraqFollow
Faez A. Al-Maamori, Department of Mathematics, College of Education for Pure Science, University of Babylon, Babylon, IraqFollow

Author Country (or Countries)

Iraq

Abstract

In this work, a new graph is called the Mobius Function Graph is introduced. Three ways of determining the prime- counting function by using this graph are presented. Also, some properties of this function are proved. Moreover, the domination, independence, chromatic, and clique number of this graph are determined. Finally, the relationship between the domination number and the independence number is discussed.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/160419

Recommended Citation

K. Al-Asadi, Sanaa; A. Omran, Ahmed; and A. Al-Maamori, Faez (2022) "Some Properties of Mobius Function Graph M(−1) in Graphs," Applied Mathematics & Information Sciences: Vol. 16: Iss. 4, Article 19.
DOI: http://dx.doi.org/10.18576/amis/160419
Available at: https://digitalcommons.aaru.edu.jo/amis/vol16/iss4/19