On Simple Graphs Arising from Exponential Congruences
We introduce and investigate a new class of graphs arrived from exponential congruences. For each pair of positive integers a and b, let G(n) denote the graph for which V={0,1,…,n−1} is the set of vertices and there is an edge between a and b if the congruence ax≡b (mod n) is solvable. Let n=p1k1p2k...
Saved in:
Main Authors: | M. Aslam Malik, M. Khalid Mahmood |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/292895 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Recursive Elucidation of Polynomial Congruences Using Root-Finding Numerical Techniques
by: M. Khalid Mahmood, et al.
Published: (2014-01-01) -
Fuzzy congruences on groups and rings
by: Marouf A. Samhan, et al.
Published: (1994-01-01) -
The Congruence of Carrollian Nonsense
by: Lawrence Gasquet
Published: (2024-11-01) -
Congruences in ordered pairs of partitions
by: Paul Hammond, et al.
Published: (2004-01-01) -
Dynamic monopolies in simple graphs
by: Leila Musavizadeh Jazaeri, et al.
Published: (2025-02-01)