Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Breeanne Baker Swart"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 1, Pp 38-53 (2016)
A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The rank number of G is define
Externí odkaz:
https://doaj.org/article/b42509a91f8b4a9c8e29e3d565a2d3f3
Publikováno v:
IEEE Transactions on Communications. 66:6329-6338
Collaborative and competitive applications require that participants receive messages almost simultaneously and before a specified time. These requirements have been addressed by the delay variation-bounded multicasting tree (DVBMT) problem. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0dbea1f201d008f41363b823153ba75e
https://doi.org/10.1109/tcomm.2018.2865484
https://doi.org/10.1109/tcomm.2018.2865484
This paper extends the concept of a $B$-happy number, for $B \geq 2$, from the rational integers, $\mathbb{Z}$, to the Gaussian integers, $\mathbb{Z}[i]$. We investigate the fixed points and cycles of the Gaussian $B$-happy functions, determining the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d1af5687db48b170ce4e042079984b4
http://arxiv.org/abs/2101.00560
http://arxiv.org/abs/2101.00560
Autor:
Simon Ghanat, Dena Garner, Jason Howison, Rebecca Hunter, Breeanne Baker Swart, Shankar Banik, Michael Verdicchio, Nathan Washuta
Publikováno v:
2018 ASEE Annual Conference & Exposition Proceedings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d4b9a25836fe586fd22f8673858e5ba
https://doi.org/10.18260/1-2--31024
https://doi.org/10.18260/1-2--31024
Autor:
Brittany Shelton, Breeanne Baker Swart
Publikováno v:
Mathematics Magazine. 88:137-143
SummaryThe nine card problem is a magic trick performed by shuffling nine playing cards according to a set of rules. The magic is that a particular card will always reappear. The success of this trick can be easily explained by considering the length
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49a1a6fa83a9655a39d4609e683ea688
https://doi.org/10.4169/math.mag.88.2.137
https://doi.org/10.4169/math.mag.88.2.137
Autor:
Laurie Zack, Christina Eubanks-Turner, Susan Crook, Kristen A. Beck, Breeanne Baker Swart, May Mei, Helen G. Grundman
Publikováno v:
Rocky Mountain J. Math. 47, no. 2 (2017), 403-417
An augmented generalized happy function, ${S_{[c,b]}} $ maps a positive integer to the sum of the squares of its base $b$ digits and a non-negative integer~$c$. A positive integer $u$ is in a \textit {cycle} of ${S_{[c,b]}} $ if, for some positive in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89fdc4a914c8ad614faee30208bec681
https://doi.org/10.1216/rmj-2017-47-2-403
https://doi.org/10.1216/rmj-2017-47-2-403
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 1, Pp 38-53 (2016)
A $k$-ranking of a directed graph $G$ is a labeling of the vertex set of $G$ with $k$ positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The rank number of $G$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d471f660cf6a488cd077b08330c8136
http://arxiv.org/abs/1702.02142
http://arxiv.org/abs/1702.02142
Autor:
Susan Crook, Breeanne Baker Swart, May Mei, Helen G. Grundman, Kristen A. Beck, Laurie Zack, Christina Eubanks-Turner
Publikováno v:
Rocky Mountain J. Math. 48, no. 1 (2018), 47-58
An augmented generalized happy function $S_{[c,b]} $ maps a positive integer to the sum of the squares of its base $b$ digits plus $c$. In this paper, we study various pro\-perties of the fixed points of $S_{[c,b]} $; count the number of fixed points
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::124afcc1dcbd9a81e96e85bdfd2d1300
http://arxiv.org/abs/1611.02983
http://arxiv.org/abs/1611.02983