Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Mohamed R. Zeen El Deen"'
Publikováno v:
Journal of Mathematics, Vol 2024 (2024)
One important algebraic invariant in networks is complexity. This invariant ensures the accuracy and dependability of the network. In this paper, we employ a combinatorial approach to determine the graph’s complexity. A fundamental set of building
Externí odkaz:
https://doaj.org/article/2b9f82f490c94901b0019e29fcf0680d
Autor:
Mohamed R. Zeen El Deen, Ghada Elmahdy
Publikováno v:
AIMS Mathematics, Vol 7, Iss 3, Pp 3554-3589 (2022)
Graph labeling is a source of valuable mathematical models for an extensive range of applications in technologies (communication networks, cryptography, astronomy, data security, various coding theory problems). An edge $ \; \delta - $ graceful label
Externí odkaz:
https://doaj.org/article/a3a6208e2d7d4b1c9f504e516fc3a279
Publikováno v:
Computation, Vol 11, Iss 8, p 162 (2023)
The complexity (number of spanning trees) in a finite graph Γ (network) is crucial. The quantity of spanning trees is a fundamental indicator for assessing the dependability of a network. The best and most dependable network is the one with the most
Externí odkaz:
https://doaj.org/article/53ad7f2192c24c82b3eaa1ed5bc85267
Publikováno v:
IEEE Access, Vol 9, Pp 56736-56756 (2021)
There are plentiful ways to duplicate a graph (network), such as splitting, shadow, mirror, and total graph. In this paper, we derive an evident formula of the complexity, a number of spanning trees, of the closed helm graph, the mirror graph of the
Externí odkaz:
https://doaj.org/article/c52e333693b9421cb880a787a2968b09
Autor:
Mohamed R. Zeen El Deen
Publikováno v:
Proyecciones (Antofagasta). 42:339-391
In graph theory, a prism over a graph G is the cartesian product of the graph G with P₂. The purpose of this work is to investigate the complexity of the prisms of some path and cycle-related graphs. In particular, we obtain simpler and more explic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2da0031e9115b8fcc4d0ee93fad84781
https://doi.org/10.22199/issn.0717-6279-4664
https://doi.org/10.22199/issn.0717-6279-4664
Autor:
Mohamed R. Zeen El Deen, Nora A. Omar
Publikováno v:
Journal of the Egyptian Mathematical Society, Vol 28, Iss 1, Pp 1-20 (2020)
Abstract In this paper, we investigated the edge even graceful labeling property of the join of two graphs. A function f is called an edge even graceful labeling of a graph G=(V(G),E(G)) with p=|V(G)| vertices and q=|E(G)| edges if f:E(G)→{2,4,...,
Externí odkaz:
https://doaj.org/article/6628e5b4abc3489da7615955af4a4dca
Autor:
Mohamed R. Zeen El Deen
Publikováno v:
Journal of the Egyptian Mathematical Society, Vol 27, Iss 1, Pp 1-15 (2019)
Abstract Edge even graceful labeling is a new type of labeling since it was introduced in 2017 by Elsonbaty and Daoud (Ars Combinatoria 130:79–96, 2017). In this paper, we obtained an edge even graceful labeling for some path-related graphs like Y-
Externí odkaz:
https://doaj.org/article/3b58ee72da7f455981fbebfe1289dde9
Autor:
Mohamed R. Zeen El Deen, Nora A. Omar
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
Edge even graceful labeling of a graph G with p vertices and q edges is a bijective f from the set of edge EG to the set of positive integers 2,4,…,2q such that all the vertex labels f∗VG, given by f∗u=∑uv∈EGfuvmod2k, where k=maxp,q, are pa
Externí odkaz:
https://doaj.org/article/2b6c26151ef9497fa051e88e15087e5e
Autor:
Mohamed R. Zeen El Deen
Publikováno v:
Advances in Mathematical Physics, Vol 2020 (2020)
In this paper, we introduce a new type of labeling of a graph G with p vertices and q edges called edge δ− graceful labeling, for any positive integer δ, as a bijective mapping f of the edge set EG into the set δ,2δ,3δ,⋯,qδ such that the in
Externí odkaz:
https://doaj.org/article/f94565e6940c4f0d80063c1ee7b32f4e
Autor:
Mohamed R. Zeen El Deen, Ghada Elmahdy
Publikováno v:
AIMS Mathematics, Vol 7, Iss 3, Pp 3554-3589 (2022)
Graph labeling is a source of valuable mathematical models for an extensive range of applications in technologies (communication networks, cryptography, astronomy, data security, various coding theory problems). An edge $ \; \delta - $ graceful label
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4b11d72aa3af8afd152d7e5ec5c3a7c
https://doi.org/10.3934/math.2022197
https://doi.org/10.3934/math.2022197