On Simple Graphs Arising from Exponential Congruences

M. Aslam Malik and M. Khalid Mahmood

Journal of Applied Mathematics, 2012, vol. 2012, 1-10

Abstract:

We introduce and investigate a new class of graphs arrived from exponential congruences. For each pair of positive integers and , let denote the graph for which is the set of vertices and there is an edge between and if the congruence is solvable. Let be the prime power factorization of an integer , where are distinct primes. The number of nontrivial self-loops of the graph has been determined and shown to be equal to . It is shown that the graph has components. Further, it is proved that the component of the simple graph is a tree with root at zero, and if is a Fermat's prime, then the component of the simple graph is complete.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2012/292895.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2012/292895.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:292895

DOI: 10.1155/2012/292895

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().