Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Bryan Freyberg"'
Autor:
Bryan Freyberg
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 373-379 (2020)
Let be an additive abelian group of order and let be a partition of where A constant sum partition (or -sum partition) of is a pairwise disjoint union of subsets such that and for some fixed and every In 2009, Kaplan, Lev, and Roditty proved that a 0
Externí odkaz:
https://doaj.org/article/cde0c80908e34a12ab849a2da2fa0e5a
Autor:
Bryan Freyberg, Melissa Keranen
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 5, Iss 2, Pp 304-311 (2017)
The following generalization of distance magic graphs was introduced in [2]. A directed Z_n-distance magic labeling of an oriented graph $\overrightarrow{G}=(V,A)$ of order n is a bijection $\overrightarrow{\ell}\colon V \rightarrow Z_n$ with the pro
Externí odkaz:
https://doaj.org/article/ea041cfcbf7049fa85389c92954ed4f6
Autor:
Bryan Freyberg, Melissa Keranen
Publikováno v:
Electronic Journal of Graph Theory and Applications. 11:81
Publikováno v:
Electronic Journal of Graph Theory and Applications. 11:273
Autor:
Melissa S. Keranen, Bryan Freyberg
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 5, Iss 2, Pp 304-311 (2017)
The following generalization of distance magic graphs was introduced in [2]. A directed Z_n-distance magic labeling of an oriented graph $\overrightarrow{G}=(V,A)$ of order n is a bijection $\overrightarrow{\ell}\colon V \rightarrow Z_n$ with the pro
Publikováno v:
Discussiones Mathematicae Graph Theory. 39:533