Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Ashraf Elrokh"'
Publikováno v:
Symmetry, Vol 16, Iss 10, p 1329 (2024)
The journal Symmetry retracts the article titled “On Cubic Roots Cordial Labeling for Some Graphs” [...]
Externí odkaz:
https://doaj.org/article/ca6116a0b42449b7952bd267c1abe553
Publikováno v:
Neutrosophic Sets and Systems, Vol 45, Pp 320-339 (2021)
In this manuscript, three contributions are proposed. First contribution is proposing a good evaluation between the fuzzy and neutrosophic approaches using a novel fuzzy-neutrosophic transfer. Second contribution is introducing a general framework fo
Externí odkaz:
https://doaj.org/article/2a1f182f7036440b9fdd97d552d3c925
Autor:
Ashraf Elrokh, Aya Rabie
Publikováno v:
Journal of the Egyptian Mathematical Society, Vol 29, Iss 1, Pp 1-13 (2021)
Abstract A simple graph is called cordial if it has 0-1 labeling that satisfies certain conditions. In this paper, we examine the necessary and sufficient conditions for cordial labeling of the sum and union of two fourth power of paths and cycles.
Externí odkaz:
https://doaj.org/article/4eaff75b4e904fd68c19335e1d70a2f1
Publikováno v:
Symmetry, Vol 15, Iss 5, p 990 (2023)
In this paper we used the cubic roots of unit group together with the concept of cordiality in graph theory to introduce a new method of labeling, this construed cubic cordial labeling can be applied to all paths, cycles, fans and wheel graphs. Moreo
Externí odkaz:
https://doaj.org/article/3ffd303de4e2429eb326173fb935cbd7
Publikováno v:
Symmetry, Vol 15, Iss 4, p 825 (2023)
In this paper, we used the permutation group together with the concept of cordiality in graph theory to introduce a new method of labeling. This construed permuted cordial labeling can be applied to all paths, cycles, fans and wheel graphs. Moreover,
Externí odkaz:
https://doaj.org/article/728b481a6cb4409dbd245b0eae9779b8
Publikováno v:
Symmetry, Vol 15, Iss 3, p 570 (2023)
Radio antennas switch signals in the form of radio waves using different frequency bands of the electromagnetic spectrum. To avoid interruption, each radio station is assigned a unique number. The channel assignment problem refers to this application
Externí odkaz:
https://doaj.org/article/f8fc3306ba7442f4ba74952ce411ca8a
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
A radio mean square labeling of a connected graph is motivated by the channel assignment problem for radio transmitters to avoid interference of signals sent by transmitters. It is an injective map h from the set of vertices of the graph G to the set
Externí odkaz:
https://doaj.org/article/8a1b7be1050a4f77ac9ad3b7b7534036
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
In this study, we propose a new kind of graph labeling which we call logic labeling and investigate the logically labeling of the corona between paths Pn and cycles Cn, namely, Pn⊙Cm. A graph is said to be logical labeling if it has a 0−1 labelin
Externí odkaz:
https://doaj.org/article/8cfb2c346bb54e0b8aef8b4eb04078a2
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
A simple graph is called cordial if it admits 0-1 labeling that satisfies certain conditions. The second order of lemniscate graph is a graph of two second order of circles that have one vertex in common. In this paper, we introduce some new results
Externí odkaz:
https://doaj.org/article/a19f52079a164185a490f103f7e40752
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
A radio labeling of a simple connected graph G=V,E is a function h :V⟶N such that hx−hy≥diamG+1−dx,y, where diam G is the diameter of graph and d(x, y) is the distance between the two vertices. The radio number of G, denoted by rnG, is the mi
Externí odkaz:
https://doaj.org/article/fb73114051ef4196bb959685a2549dde