Construction of Graphs and Zero-Divisor Graphs by Degree-Joint Operations of Graphs

Mohammed N. Authman, Payman A. Rashed and Husam Q. Mohammad

International Journal of Mathematics and Mathematical Sciences, 2026, vol. 2026, 1-12

Abstract: The new construction of graphs obtained by degree-joint operations between maximum-degree and minimum-degree of some types of graphs with different vertex and edge sets denoted by Gδ,GΔ respectively, joins vertices of maximum (minimum) degree in one graph with those of the same type in the other graph of the second graph, where the degree-joint operation is defined as minimum–maximum or maximum–minimum degree, denoted by G∇. In the current paper, we have examined the important properties of these graphs obtained by a new process and concluded that if one of the graphs G1 or G2 is regular, then GΔ, Gδ, and G∇ are n+mG-regular. Obviously, the new graphs are connected if one of the components is connected, with a diameter less than the sum of the diameters of the component graphs G1 and G2. Finally, we find some important properties of the maximum-degree join of the zero-divisor graph of local rings and the direct product of two finite fields.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/ijmms/2026/3902093.pdf (application/pdf)
http://downloads.hindawi.com/journals/ijmms/2026/3902093.xml (application/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:jijmms:3902093

DOI: 10.1155/ijmm/3902093

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().