Academic Journal
Construction of Graphs and Zero‐Divisor Graphs by Degree‐Joint Operations of Graphs.
| Τίτλος: | Construction of Graphs and Zero‐Divisor Graphs by Degree‐Joint Operations of Graphs. |
|---|---|
| Συγγραφείς: | Authman, Mohammed N.1 (AUTHOR) alghabshaa@gmail.com, Rashed, Payman A.2 (AUTHOR), Mohammad, Husam Q.3 (AUTHOR), Binwal, Shikha (AUTHOR) sbinwal@wiley.com |
| Πηγή: | International Journal of Mathematics & Mathematical Sciences. 9/24/2026, Vol. 2026, p1-12. 12p. |
| Θεματικοί όροι: | *Regular graphs, *Local rings (Algebra), *Diameter |
| Περίληψη: | 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 + m(G)‐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. [ABSTRACT FROM AUTHOR] |
| Βάση Δεδομένων: | Academic Search Index |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:asx&genre=article&issn=01611712&ISBN=&volume=2026&issue=&date=20260924&spage=1&pages=1-12&title=International Journal of Mathematics & Mathematical Sciences&atitle=Construction%20of%20Graphs%20and%20Zero%E2%80%90Divisor%20Graphs%20by%20Degree%E2%80%90Joint%20Operations%20of%20Graphs.&aulast=Authman%2C%20Mohammed%20N.&id=DOI:10.1155/ijmm/3902093 Name: Full Text Finder (for New FTF UI) (ns324271) Category: fullText Text: Full Text Finder MouseOverText: Full Text Finder |
|---|---|
| Header | DbId: asx DbLabel: Academic Search Index An: 197346413 RelevancyScore: 1452 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1452.42810058594 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Construction of Graphs and Zero‐Divisor Graphs by Degree‐Joint Operations of Graphs. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Authman%2C+Mohammed+N%2E%22">Authman, Mohammed N.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> alghabshaa@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Rashed%2C+Payman+A%2E%22">Rashed, Payman A.</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Mohammad%2C+Husam+Q%2E%22">Mohammad, Husam Q.</searchLink><relatesTo>3</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Binwal%2C+Shikha%22">Binwal, Shikha</searchLink> (AUTHOR)<i> sbinwal@wiley.com</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Mathematics+%26+Mathematical+Sciences%22">International Journal of Mathematics & Mathematical Sciences</searchLink>. 9/24/2026, Vol. 2026, p1-12. 12p. – Name: Subject Label: Subject Terms Group: Su Data: *<searchLink fieldCode="DE" term="%22Regular+graphs%22">Regular graphs</searchLink><br />*<searchLink fieldCode="DE" term="%22Local+rings+%28Algebra%29%22">Local rings (Algebra)</searchLink><br />*<searchLink fieldCode="DE" term="%22Diameter%22">Diameter</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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 + m(G)‐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. [ABSTRACT FROM AUTHOR] |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=asx&AN=197346413 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1155/ijmm/3902093 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 12 StartPage: 1 Subjects: – SubjectFull: Regular graphs Type: general – SubjectFull: Local rings (Algebra) Type: general – SubjectFull: Diameter Type: general Titles: – TitleFull: Construction of Graphs and Zero‐Divisor Graphs by Degree‐Joint Operations of Graphs. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Authman, Mohammed N. – PersonEntity: Name: NameFull: Rashed, Payman A. – PersonEntity: Name: NameFull: Mohammad, Husam Q. – PersonEntity: Name: NameFull: Binwal, Shikha IsPartOfRelationships: – BibEntity: Dates: – D: 24 M: 09 Text: 9/24/2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 01611712 Numbering: – Type: volume Value: 2026 Titles: – TitleFull: International Journal of Mathematics & Mathematical Sciences Type: main |
| ResultId | 1 |