Graph Structures of Euler Totient Numbers
Kumar, R. V M S S Kiran
MetadataShow full item record
Abstract: In this paper, we initiate the study of graphs of Euler totient numbers. It is shown that these graphs are disconnected, totally disconnected, regular, Eulerian and Hamiltonian. Also, Domination number, Clique number, Matching domination number, perfect matching number, chromatic number and girth of Euler graphs are studied. Moreover, we specify density and probability of Euler graphs.