Submitted:
21 October 2024
Posted:
22 October 2024
You are already at the latest version
Abstract
Keywords:
MSC: 05C25; 05C50; 05C75
1. Introduction
2. Preliminaries
- 1.
- If and are adjacent in , then every element of is adjacent to every element of .
- 2.
- If , then is a coclique in .
- 3.
- If , then is a clique in .
- 1.
- If , then the unit graph is a -regular graph.
- 2.
- If , then for every we have , and for every we have .
- 1.
- If , then the Laplacian spectrum of is
- 2.
- If , then the Laplacian spectrum of is
3. as a Generalized Join Graph
- 1.
- For , the induced subgraph of on the vertex set is either the complete graph or its complement graph . Indeed, is if and only if .
- 2.
- For with , a vertex of is adjacent to either all or none of the vertices of in .
4. Laplacian Spectrum of
- 1.
- If , then .
- 2.
- If , then
- 1.
- If , then
- 2.
- If , then
- 1.
- If , then the Laplacian spectrum of consists of
- 2.
- If , then the Laplacian spectrum of is
- 1.
- If , then the Laplacian spectrum of consists of
- 2.
- If , then the Laplacian spectrum of consists of
5. Vertex Connectivity of
5.1. Structure of
- 1.
- Let . The induced subgraph of is isomorphic to 1. If , then is .
- 2.
- Let and . If , then every vertex of is adjacent to vertices of .
- 3.
- Let and . If , then every vertex of is nonadjacent to any vertex of .
- 1.
- is nonadjacent to since .
- 2.
- Each vertex in and is adjacent to 4 vertices in .
- 3.
- is isomorphic to and and are isomorphic to . The red vertices 0, 5, and 10 represent in , , and , respectively. Note that these vertices are multiples of 5.
- 1.
- If and are nonadjacent in , then the number of common neighbors between and in is .
- 1.
- If and are adjacent in , where , then the number of common neighbors between and in is .
- 3.
- The number of common neighbors between and in is .
- Let and be nonadjacent in . By Lemma 7, and . Hence, is adjacent to all vertices in except . Similarly, is adjacent to all vertices in except . So, and are adjacent to all vertices in except and . Therefore, there are common neighbors between and in .
-
Let and be adjacent in , where . According to Lemma 7, and are nonadjacent to and in , respectively. So, and are adjacent to all vertices in except and , respectively. Then, the set of common neighbors between and in isThus, there are common neighbors between and in .
-
By Lemma 7, is adjacent to all vertices in . Also, is adjacent to all vertices in except . So, the set of common neighbors between and in isThen, there are common neighbors between and in . □
- 1.
- If x and y have the same neighbors in , then the number of common neighbors in between x and y is .
- 2.
- If x and y do not have the same neighbors in , then the number of common neighbors in between x and y is .
- 1.
- The proof is direct from Part 2 of Lemma 6.
- 2.
- Let x and y do not have the same neighbors in . By Part 2 of Lemma 6, both x and y have neighbors in . That is, x and y are adjacent to all vertices in except and , respectively. So, the number of the common neighbors in between x and y is . □
5.2. Number of Internally Disjoint Paths between Nonadjacent Vertices in
- 1.
- If , then there are internally disjoint paths of length 4 between x and y.
- 2.
- If , then there are internally disjoint paths of length 4 between x and y.
- Let . By Part 2 of Lemma 6, and in are adjacent to vertices of . Since we investigate the internally disjoint paths between x and y through and , we can choose a vertex w from that is adjacent to both and . This path will be of length 4, as illustrated in Figure 4 (a). Similarly, for each neighbor of in there is one internally disjoint path of length 4 between x and y. By Lemma 7, there are neighbors of in . Therefore, there are internally disjoint paths of length 4 between x and y through all neighbors of .
- Let . By Part 2 of Lemma 6, and in are adjacent to vertices of . Approaching the proof in a similar manner as with Part 1, there is a path of length 4, as shown in Figure 4 (b). By Lemma 7, the number of neighbors of in is . So, there are internally disjoint paths of length 4 between x and y through all neighbors of . □
- 1.
- If x and y have the same neighbors in , then there are internally disjoint paths of length 2 between x and y.
- 2.
- If x and y do not have the same neighbors in , then there are internally disjoint paths of length 2 between x and y.
- If x and y have the same neighbors in , then there are common neighbors between x and y in by Lemma 10. Thus, there are internally disjoint paths of length 2 between x and y through . Hence, there are internally disjoint paths of length 2 between x and y through all common neighbors between and in .
- If x and y do not have the same neighbors in , then there are common neighbors between x and y in by Lemma 10. So, there are internally disjoint paths of length 2 between x and y through . Therefore, there are internally disjoint paths of length 2 between x and y through all common neighbors between and in . □
- 1.
- If x and y have the same neighbors in , then there are internally disjoint paths of length 4 between x and y.
- 2.
- If x and y do not have the same neighbors in , then there are internally disjoint paths of length 3 between x and y.
- Let x and y have the same neighbors in . By Lemma 6, has at least neighbors in and each of them is adjacent to vertices of . Then, we can choose a neighbor, say , of x in such that , where is nonadjacent to both x and y. Similarly, we can choose a neighbor of y in such that . Therefore, there exists a path of length 4 of the form , see Figure 5 (a). So, there are internally disjoint paths of length 4 between x and y through all common neighbors between and in .
- Let x and y do not have the same neighbors in . By proof of Lemma 10, x and y are adjacent to all vertices in except and , respectively. Approaching the proof similarly as Part 1, we can choose a neighbor of x in and a neighbor of y in , where and . Since and , two internally disjoint paths of length 3 exist. These paths are described in Figure 5 (b). Hence, there are internally disjoint paths of length 3 between x and y through all common neighbors between and in . □
- 1.
- There are internally disjoint paths of length 2 between x and y.
- 2.
- There are internally disjoint paths of length 2 between x and y.
-
Assume that x and y have the same neighbors in . By Proposition 2 and Lemma 10, and and there are common neighbors between x and y through . So, there are internally disjoint paths of length 2 between x and y through . If , then there are internally disjoint paths of length 2 between x and y through all common neighbors between and in . Further, x (resp. y) is adjacent to all vertices in (resp. ). Also, x (resp. y) is adjacent to all vertices in (resp. ) except y (resp. x). So, the set of common neighbors between x and y in and is union . Thus, there are common neighbors between x and y in and . Consequently, there are internally disjoint paths of length 2 between x and y in and . Therefore, the total number of internally disjoint paths of length 2 between x and y isIf , then there are internally disjoint paths of length 2 between x and y through all common neighbors between and in . Further, x is adjacent to all vertices in and y is nonadjacent to any vertex in . Also, x (resp. y) is adjacent to all vertices in (resp. ) except y (resp. x). So, the set of common neighbors between x and y in and are . Thus, there are common neighbors between x and y in and . Then, there are internally disjoint paths of length 2 between x and y in and . Thus, the total number of internally disjoint paths of length 2 between x and y is
-
Assume that x and y do not have the same neighbors in . By Proposition 2 and Lemma 10, and and there are common neighbors between x and y in . Thus, there are internally disjoint paths of length 2 between x and y through . If , then there are internally disjoint paths of length 2 between x and y through all common neighbors between and in . Furthermore, x (resp. y) is adjacent to all vertices except only one vertex (resp. ) in (resp. ). Also, x (resp. y) is adjacent to all vertices in (resp. ) except y (resp. x). Thus, the set of common neighbors between x and y in and is union . So, there are common neighbors between x and y in and . As a result, there are internally disjoint paths of length 2 between x and y in and . Therefore, the total number of internally disjoint paths of length 2 between x and y isIf , then there are internally disjoint paths of length 2 between x and y through all common neighbors between and in . Further, x is adjacent to all vertices except only one vertex in , and y is nonadjacent to any vertex in . Also, x (resp. y) is adjacent to all vertices in (resp. ) except y (resp. x). Thus, the set of common neighbors between x and y in and is . So, there are common neighbors between x and y in and . Then, there are internally disjoint paths of length 2 between x and y in and . Thus, the total number of internally disjoint paths of length 2 between x and y is
- 1.
- There are internally disjoint paths of length 3 between x and y.
- 2.
- There are internally disjoint paths of length 3 between x and y.
- 3.
- There are internally disjoint paths of length 3 between x and y.
- Assume that x and y have the same neighbors in . Indeed, and by Proposition 2. If , there are neighbors of x in , denote these neighbors by such that , and each of them is adjacent to vertices of by Part 2 of Lemma 6. Similarly, there are neighbors of y in , and each of them is adjacent to vertices of . To get the internally disjoint paths of length 3 between x and y, we choose one of the neighbors of , say , in such that is a neighbor of y. Indeed, for each in there is one internally disjoint path between x and y through and . Therefore, the total number of internally disjoint paths of length 3 between x and y through and together is equal to the number of neighbors of x in , which is . Now let . There are neighbors of x in and each of them is adjacent to vertices of . Since there are neighbors of y in , so there are more than paths of length 3 between x and y through and together. By applying the same method in the case where , there are internally disjoint paths of length 3 between x and y.
-
Assume that x and y do not have the same neighbors in . So, and by Proposition 2. Suppose that is a common neighbor between and in . By proof of Lemma 10, x and y are adjacent to all vertices in except and , respectively. Let . Since x has neighbors in and each of these neighbors is adjacent to vertices of , then we can choose a neighbor of x in such that . Similarly, we can choose a neighbor of y in such that . Since and , there exist two internally disjoint paths of length 3 between x and y, as illustrated in Figure 6 (a). By Part 2 of Lemma 8, there are common neighbors between and in . Then, there are internally disjoint paths of length 3 between x and y through all common neighbors between and in . After removing all and from and , respectively, then the number of remaining neighbors of x and y in and , respectively, is . So, there are internally disjoint paths length 3 between x and y that pass through the remaining of neighbors of x and y in and , respectively, together. So, the total number of internally disjoint paths of length 3 between x and y isLet . Since x has neighbors in and each of these neighbors is adjacent to vertices of , then we can choose a neighbor of x in such that . Similarly, we can choose a neighbor of y in such that . Since and , there exist two internally disjoint path of length 3 between x and y, as illustrated in Figure 6 (b). By Part 3 of Lemma 8, there are common neighbors between and in . Consequently, there are internally disjoint paths of length 3 between x and y through all common neighbors between and in . After removing all and from and , respectively, then the number of remaining neighbors of x and y in and , respectively, is . So, there are internally disjoint paths length 3 between x and y that pass through the rest of neighbors of x and y in and , respectively, together. So, the total number of internally disjoint paths of length 3 between x and y is
5.3. Vertex Connectivity of
- (a)
- Let . By lemma 12, there are internally disjoint paths of length 4 between x and y. So, the maximum number of internally disjoint paths between x and y is
- (b)
- Let . By Lemma 12, there are internally disjoint paths of length 4 between x and y. So, the maximum number of internally disjoint paths between x and y is
- (a)
- If y has the same neighbors as x in , then there are internally disjoint paths of length 2 between x and y by Lemma 13. According to Lemma 14, there are internally disjoint paths of length 4 between x and y. Hence, the maximum number of internally disjoint paths between x and y is
- (b)
- If x and y do not have the same neighbors in , there are internally disjoint paths of length 2 between x and y by Lemma 13. According to Lemma 14, there are internally disjoint paths of length 3 between x and y. Hence, the maximum number of internally disjoint paths between x and y is
- (a)
- If y has the same neighbors as x in , then there are internally disjoint paths of length 2 between x and y by proof of Lemma 15. According to proof of Lemma 16, there are internally disjoint paths of length 3 between x and y. Hence, the maximum number of internally disjoint paths between x and y is
- (b)
-
If x and y do not have the same neighbors in , then there are internally disjoint paths of length 2 between x and y by proof of Lemma 15. In addition, there are other internally disjoint paths depending on the following cases for i and j:
- (1)
- Let . According to proof of Lemma 16, there are internally disjoint paths of length 3 between x and y. Therefore, the maximum number of internally disjoint paths between x and y is
- (2)
- Let . According to proof of Lemma 16, there are internally disjoint paths of length 3 between x and y. So, the maximum number of internally disjoint paths between x and y is
6. Conclusions
Author Contributions
Funding
Data Availability Statement
Conflicts of Interest
Appendix A

References
- Grimaldi, R.P. Graphs from rings. In Proceedings of the 20th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, USA, 20–24 February 1989; Volume 71, pp. 95–103. [Google Scholar]
- Su, H.; Yang, L. Domination number of unit graph of . Discrete Math. Algorithms Appl. 2020, 12, 2050059. [Google Scholar] [CrossRef]
- Shen, S.; Liu, W.; Jin, W. Laplacian eigenvalues of the unit graph of the ring Zn. Appl. Math. Comput. 2023, 459, 128268. [Google Scholar] [CrossRef]
- Fakieh, W.; Alsaluli, A.; Alashwali, H. Laplacian spectrum of the unit graph associated to the ring of integers modulo pq. AIMS Math. 2023, 9, 4098–4108. [Google Scholar] [CrossRef]
- Ashrafi, N.; Maimani, H.R.; Pournaki, M.R.; Yassemi, S. Unit graphs associated with rings. Commun. Algebra 2010, 38, 2851–2871. [Google Scholar] [CrossRef]
- Maimani, H.R.; Pournaki, M.R.; Yassemi, S. Necessary and sufficient conditions for unit graphs to be Hamiltonian. Pacific J. Math. 2011, 249, 419–429. [Google Scholar] [CrossRef]
- Su, H.; Zhou, Y. On the girth of the unit graph of a ring. J. Algebra Appl. 2014, 13, 1350082. [Google Scholar] [CrossRef]
- Akbari, S.; Estaji, E.; Khorsandi, M.R. On the unit graph of a noncommutative ring. Algebra Colloq. 2015, 22, 817–822. [Google Scholar] [CrossRef]
- Abdelkarim, H.A.; Rawshdeh, E.; Rawashdeh, E. The eigensharp property for unit graphs associated with some finite rings. Axioms 2022, 11, 349. [Google Scholar] [CrossRef]
- Chattopadhyay, S.; Patra, K.L.; Sahoo, B.K. Laplacian eigenvalues of the zero divisor graph of the ring . Linear Algebra Appl. 2020, 584, 267–286. [Google Scholar] [CrossRef]
- Banerjee, S. Laplacian spectrum of comaximal graph of the ring . Spec. Matrices 2022, 10, 285–298. [Google Scholar] [CrossRef]
- Mathil, P.; Baloda, B.; Kumar, J. On the cozero-divisor graphs associated to rings. AKCE Int. J. of Graphs Comb. 2022, 19, 238–248. [Google Scholar] [CrossRef]
- Cvetković, D.M.; Rowlison, P.; Simić, S. An Introduction to Theory of Graph Spectra; London Math. S. Student Text, 75; Cambridge University Press, Inc.: Cambridge, UK, 2010. [Google Scholar] [CrossRef]
- Pirzada, S.; Ganie, H.A. On the Laplacian eigenvalues of a graph and Laplacian energy. Linear Algebra Appl. 2015, 486, 454–468. [Google Scholar] [CrossRef]
- Schwenk, A.J. Computing the characteristic polynomial of a graph. In Proceedings of the Capital Conference, Graphs and Combinatorics, Lecture Notes in Mathematics, Springer, Berlin, Heidelberg, 18-22 June 1973; Volume 406, pp. 153–172. [Google Scholar] [CrossRef]
- Cardoso, D.M.; De Freitas, M.A.A.; Martins, E.A.; Robbiano, M. Spectra of graphs obtained by a generalization of the join of graph operation. Discrete Math. 2013, 313, 733–741. [Google Scholar] [CrossRef]
- Balakrishnan, R.; Ranganathan, K. A Textbook of Graph Theory; Springer-Verlag New York, Inc.: New York, 2000. [Google Scholar]
- Alsaluli, A.; Fakieh, W.; Alashwali, H. Laplacian spectrum of the unit graph of the ring . Proceedings of International Conference and Exhibition for Science (ICES 2023), College of Science, King Saud University, Riyadh, Saudi Arabia, February 2023. [Google Scholar]
- Pranjali; Acharya, M. Energy and Wiener index of unit graph. Appl. Math. Inf. Sci. 2015, 9, 1339–1343. [Google Scholar]
| 1 |
is the cocktail party graph, which is obtained from the complete graph , , by deleting a perfect matching, where a perfect matching of graph G is a 1-regular spanning subgraph H of G. |






Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).