Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Aaron Shepanik"'
Autor:
Dalibor Froncek, Aaron Shepanik
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1, Pp 259-273 (2022)
A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f : V → {1, 2, …, n} with the property that f(xi)=i, the weight w(xi) is the sum of labels of all neighbors of xi, and the sequence of the weights w(x1),w
Externí odkaz:
https://doaj.org/article/3587b06d6d804998958e72d37ffa6d61
Autor:
Dalibor Froncek, Aaron Shepanik
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 6, Iss 2, Pp 208-218 (2018)
A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f̂ : V → {1, 2, …, n} with the property that f̂(xi) = i, the weight w(xi) is the sum of labels of all neighbors of xi, and the sequence of the weights w
Externí odkaz:
https://doaj.org/article/4a9910672de947d38d37f7f9d7c4b4f6
Autor:
Aaron Shepanik, Dalibor Froncek
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 6, Iss 2, Pp 208-218 (2018)
A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f̂ : V → {1, 2, …, n} with the property that f̂(xi) = i, the weight w(xi) is the sum of labels of all neighbors of xi, and the sequence of the weights w
Autor:
Adam Silber, Michal Kravčenko, Petr Kovář, Bohumil Krajc, Aaron Shepanik, Tereza Kovářová, Dalibor Froncek
Publikováno v:
Electronic Notes in Discrete Mathematics. 60:69-76
Let G = ( V , E ) be a simple graph of order n. A bijection f : V → { 1 , 2 , … , n } is a handicap labeling of G if there exists an integer l such that ∑ u ∈ N ( v ) f ( u ) = l + f ( v ) for all v ∈ V , where N(v) is the set of all vertic
Autor:
Aaron Shepanik, Dalibor Froncek
Publikováno v:
Journal of Algebra Combinatorics Discrete Structures and Applications, Vol 3, Iss 3 (2016)
A handicap distance antimagic labeling of a graph $G=(V,E)$ with $n$ vertices is a bijection ${f}: V\to \{ 1,2,\ldots ,n\} $ with the property that ${f}(x_i)=i$ and the sequence of the weights $w(x_1),w(x_2),\ldots,w(x_n)$ (where $w(x_i)=\sum\limits_