Structural Properties of Graphs Defined by Bilinear Congruence on the Ring of Integers Modulo n
Main Article Content
Abstract
We investigate the structural properties of a graph defined on the ring . The Adjacency between two different vertices and is determined by the bilinear congruence . We analyze three fundamental cases, and for distinct odd primes . We describe the graph's breakdown into unit and non-unit vertex subsets. The unit subgraph forms disjoint cliques, with sizes depending on Euler's totient function. In contrast, the zero-divisor subgraph shows more complex behaviour governed by annihilation ideals. We establish general properties, including degree formulas, determination of maximum clique sizes in each component, determining the diameter, computing the girth, locating the graph centers, and finding the measures of vertex and edge connectivity. Additionally, we characterize independent sets and prove the existence of Hamiltonian cycles and supereulerian properties under certain connectivity conditions. Our results show how the prime factorization of influences these properties.
Article Details

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
References
. D. F. Anderson and P. S. Livingston, “The Zero-Divisor graph of a commutative ring,” Journal of Algebra, vol. 217, no. 2, pp. 434–447, Jul. 1999, doi: 10.1006/jabr.1998.7840.
. A. Badawi, “On the Dot Product Graph of a Commutative Ring,” Communications in Algebra, vol. 43, no. 1, pp. 43–50, Aug. 2014, doi: 10.1080/00927872.2014.897188.
. A. E. Brouwer and W. H. Haemers, Spectra of graphs. 2011. doi: 10.1007/978-1-4614-1939-6.
. J. Rotman, Advanced modern algebra. 3rd ed., 2015. doi: 10.1090/gsm/165.
. D. S. Dummit and R. M. Foote, Abstract Algebra, 3rd ed., Wiley 1999.
. P. Aluffi, Algebra: Notes from the Underground. Cambridge University Press, 2021.
. D. Eisenbud, Commutative algebra: with a View Toward Algebraic Geometry. Springer Science & Business Media, 2013.
. J. Gallian, Contemporary Abstract algebra. CRC Press, 2021.
. C. Godsil and G. F. Royle, Algebraic graph Theory. Springer Science & Business Media, 2013.
. G. Chartrand, L. Lesniak, and P. Zhang, Graphs & Digraphs, 7th ed. CRC Press, 2004.
. D. B. West, Introduction to graph Theory. 2nd ed. Prentice Hall, 2001.
. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. London : Macmillan Press, 1976.
. L. Han, H.-J. Lai, L. Xiong, and H. Yan, “The Chvátal–Erdös condition for supereulerian graphs and the Hamiltonian index,” Discrete Mathematics, vol. 310, no. 15–16, pp. 2082–2090, Apr. 2010, doi: 10.1016/j.disc.2010.03.020.
. J. Bang‐Jensen and A. Maddaloni, “Sufficient Conditions for a Digraph to be Supereulerian,” Journal of Graph Theory, vol. 79, no. 1, pp. 8–20, Jun. 2014, doi: 10.1002/jgt.21810.
. P. A. Catlin, “Supereulerian graphs: A survey,” Journal of Graph Theory, vol. 16, no. 2, pp. 177–196, Jun. 1992, doi: 10.1002/jgt.3190160209.
. P. A. Catlin and H.-J. Lai, “SuperEulerian Graphs and the Petersen Graph,” Journal of Combinatorial Theory Series B, vol. 66, no. 1, pp. 123–139, Jan. 1996. doi: 10.1006/jctb.1996.0009.
. B. Cooperstein, Advanced Linear Algebra, 2nd ed. Chapman and Hall/CRC, 2015.