### Sifat Fundamental Pada Granum Eulerian

#### Abstract

Mathematical analysis has several important connections with graph theory. Although initially, they may seem like two separate branches of mathematics, there are relationship between them in several aspects, such as graphs as mathematical objects that can be analyzed using concepts from analytic mathematics. In graph theory, one often studies distance, connectivity, and paths within a graph. These can be further analyzed using analytic mathematics, such as in the structure of natural numbers. Literature studies on graph theory, especially Eulerian graphs, are interesting to explore. An Eulerian path in a graph G is a path that includes every edge of graph G exactly once. An Eulerian path is called closed if it starts and ends at the same vertex. The concept of granum theory as a generalization of undirected graphs on number structures provides a rigorous approach to graph theory and demonstrates some fundamental properties of undirected graph generalization. The focus of this study is to introduce the connectivity properties of Eulerian granum. The granum G(e,M) is called connected if for every u,v ∈ M with u ≠ v there exists a path subgranumG^' (e,M^' )⊆ G(e,M) where u,v ∈ M^' and is called an Eulerian granum if there exists a surjective mapping ϕ∶ [∥E(G(e,M))∥ + 1]→ M such that e(ϕ(n),ϕ(n+1))=1 for every n ∈ [‖E(G(e,M))‖]. This property provides a deeper understanding of the structure and characteristics of Eulerian granum, which have not been fully comprehended until now.

#### Keywords

#### Full Text:

PDF#### References

F. Daniel and P. Taneo, Teori Graf. Yogyakarta: Penerbit Deepublish, 2019.

A. Khan and S. A. Kauser, “A study of some domination parameters of undirected power graphs of Cyclic groups A study of some domination parameters of undirected power graphs of Cyclic groups,” Int. J. Futur. Gener. Commun. Netw., vol. 13, no. August 2020, pp. 2674–2677, 2023.

S. Dalal, J. Kumar, and S. Singh, “On the Connectivity and Equality of Some Graphs on Finite Semigroups,” Bull. Malaysian Math. Sci. Soc., vol. 46, no. 1, p. 25, 2022, doi: 10.1007/s40840-022-01411-z.

I. Chakrabarty, J. V. Kureethara, and M. Acharya, “a Study of an Undirected Graph on a Finite Subset of Natural Numbers,” South East Asian J. Math. Math. Sci., vol. 18, no. 3, pp. 433–448, 2022, doi: 10.56827/SEAJMMS.2022.1803.35.

I. Chakrabarty, M. Acharya, and J. V. Kureethara, “on the Generalized Complement of Some Graphs,” Asia Pacific J. Math., vol. 8, no. 22, pp. 1–7, 2021, doi: 10.28924/APJM/8-22.

I. Chakrabarty, J. V. Kureethara, and M. Acharya, “THE G (m,n) GRAPH ON A FINITE SUBSET OF NATURAL NUMBERS,” India, 2021, pp. 45–59.

I. Chakrabarty, “On some structural properties of (Gm,n) graphs,” Mapana Jounal Sci., vol. 18, no. 2, pp. 45–52, 2019, doi: 10.12723/mjs.50.3.

S. A. Kauser and M. Siva Parvathi, “Domatic number of an undirected graph G(m,n),” Adv. Math. Sci. J., vol. 9, no. 10, pp. 7859–7864, 2020, doi: 10.37418/amsj.9.10.18.

S. A. Kauser and A. Khan, “Clique Domination in an Undirected Graph G (m, n),” J. Comput. Math. Sci., vol. 10, no. September, pp. 1585–1588, 2019.

S. A. Kauser and M. S. Parvati, “Independent, Connected and Connected Total Domination in an Undirected Graph G (m,n),” J. Comput. Math. Sci., vol. 10, no. 5, pp. 1077–1081, 2019, doi: 10.29055/jcms/1093.

A. Asriadi, “Sebuah Generalisasi Graf Tak Berarah Pada Himpunan Bagian Terbatas Dari Bilangan Asli,” J. Mat. UNAND, vol. 11, no. 1, p. 47, 2022, doi: 10.25077/jmu.11.1.47-52.2022.

I. Chakrabarty, J. V. Kureethara, and M. Acharya, “An Undirected Graph On A Finite Subset Of Natural Numbers,” Indian J. Discret. Math, vol. 1, no. 3, pp. 128–138, 2021, doi: 10.56827/SEAJMMS.2022.1803.35.

G. Costain, “On the Additive Graph Generated by a Subset of the Natural Numbers,” McGILL University, 2008.

DOI: http://dx.doi.org/10.12962/limits.v21i2.20164

### Refbacks

- There are currently no refbacks.

Jumlah Kunjungan:

Limits: Journal Mathematics and its Aplications by Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Based on a work at https://iptek.its.ac.id/index.php/limits.