Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Melissa Keranen"'
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:
Melissa Keranen, Juho Lauri
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 20 no. 1, Iss Graph Theory (2018)
A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices. If there is a rainbow shortest path between every pair of vertice
Externí odkaz:
https://doaj.org/article/362c6e73f6d947d59353d0ce4bc11126
Autor:
Bryan Freyberg, Melissa Keranen
Publikováno v:
Electronic Journal of Graph Theory and Applications. 11:81
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8db7638aa081388ab86086cfe35ff8ee
https://doi.org/10.5614/ejgta.2023.11.1.7
https://doi.org/10.5614/ejgta.2023.11.1.7
Publikováno v:
2015 ASEE Annual Conference and Exposition Proceedings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f5a7d7faadce18d30cd76a4cabad5fb
https://doi.org/10.18260/p.24708
https://doi.org/10.18260/p.24708