Zobrazeno 1 - 10
of 407
pro vyhledávání: '"Edge-graceful labeling"'
Autor:
Mohammed Aljohani, Salama Nagy Daoud
Publikováno v:
Mathematics, Vol 12, Iss 8, p 1203 (2024)
A graph’s edge labeling involves the allocation of symbols (colors or numbers) to the edges of a graph governed by specific criteria. Such labeling of a graph G with order n and size m is named edge odd graceful if there is a bijective map φ from
Externí odkaz:
https://doaj.org/article/915353d3edc4456fa25397f93e8f4377
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 25:53-72
Autor:
Salama Nagy Daoud
Publikováno v:
Symmetry, Vol 11, Iss 1, p 38 (2019)
Edge Even Graceful Labelingwas first defined byElsonbaty and Daoud in 2017. An edge even graceful labeling of a simple graph with vertices and edges is a bijection from the edges of the graph to the set such that, when each vertex is assigned the sum
Externí odkaz:
https://doaj.org/article/1b24a76788d9400b9e741ddb3bc1e8b1
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Tomáš Masařík, Dušan Knop
Publikováno v:
Discrete Applied Mathematics. 246:80-98
The problem of Distance Edge Labeling is a variant of Distance Vertex Labeling (also known as $L_{2,1}$ labeling) that has been studied for more than twenty years and has many applications, such as frequency assignment. The Distance Edge Labeling pro
Autor:
Martín Matamala, José Zamora
Publikováno v:
Discrete Applied Mathematics. 245:194-201
A graph G = ( V , E ) is weighted- k -antimagic if for each w : V → R , there is an injective function f : E → { 1 , … , | E | + k } such that the following sums are all distinct: for each vertex u , ∑ v : u v ∈ E f ( u v ) + w ( u ) . When
Autor:
Tao-Ming Wang, Guang-Hui Zhang
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 1, Pp 105-111 (2018)
An edge-graceful labeling of a finite simple graph with p vertices and q edges is a bijection from the set of edges to the set of integers { 1 , 2 , … , q } such that the vertex sums are pairwise distinct modulo p , where the vertex sum at a vertex
Autor:
Dan McQuillan, James M. McQuillan
Publikováno v:
Discrete Mathematics. 341:194-202
Let G be a 2-regular graph with 2 m + 1 vertices and assume that G has a strong vertex-magic total labeling. It is shown that the four graphs G ∪ 2 m C 3 , G ∪ ( 2 m + 2 ) C 3 , G ∪ m C 8 and G ∪ ( m + 1 ) C 8 also have a strong vertex-magic