Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Melissa S. Keranen"'
Autor:
Melissa S. Keranen, John Asplund
Publikováno v:
Graphs and Combinatorics. 36:415-436
A $${\mathrm{TS}}(v,{\lambda })$$ is a pair $$(V,\mathcal {B})$$ where V contains v points and $$\mathcal {B}$$ contains 3-element subsets of V so that each pair in V appears in exactly $${\lambda }$$ blocks. A 2-block intersection graph (2-BIG) of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f82999199cbdc06cdbf1d1c8f04f4a7f
https://doi.org/10.1007/s00373-019-02107-1
https://doi.org/10.1007/s00373-019-02107-1
Publikováno v:
Designs, Codes and Cryptography. 86:2183-2195
A decomposition of the blocks of an $$\textsf {STS}(v)$$ into partial parallel classes of size m is equivalent to a Kirkman signal set $$\textsf {KSS}(v,m)$$ . We give decompositions of $$\textsf {STS}(4v-3)$$ into classes of size $$v-1$$ when $$v \e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55dcdc662dadb799eee9817cd8626839
https://doi.org/10.1007/s10623-017-0445-2
https://doi.org/10.1007/s10623-017-0445-2
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f99c84cff5d96e76d78ccb53811251d
https://ejgta.org/index.php/ejgta/article/view/282
https://ejgta.org/index.php/ejgta/article/view/282
Autor:
Adrián Pastine, Melissa S. Keranen
Publikováno v:
Journal of Combinatorial Designs. 25:431-468
The Hamilton–Waterloo problem asks for which s and r the complete graph Kn can be decomposed into s copies of a given 2-factor F1 and r copies of a given 2-factor F2 (and one copy of a 1-factor if n is even). In this paper, we generalize the proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::336c93a0fee5fa314f802556ef36bfd7
https://doi.org/10.1002/jcd.21560
https://doi.org/10.1002/jcd.21560
Autor:
Melissa S. Keranen, Adrián Pastine
Publikováno v:
Ars mathematica contemporanea
The Hamilton-Waterloo problem asks for a decomposition of the complete graph into $r$ copies of a 2-factor $F_{1}$ and $s$ copies of a 2-factor $F_{2}$ such that $r+s=\left\lfloor\frac{v-1}{2}\right\rfloor$. If $F_{1}$ consists of $m$-cycles and $F_{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::efb927eb86004aa13551d405e8023f44
http://www.dlib.si/details/URN:NBN:SI:doc-PQ3QJVUG
http://www.dlib.si/details/URN:NBN:SI:doc-PQ3QJVUG
Publikováno v:
Discrete Mathematics. 338:743-765
A k -cycle system of a multigraph G is an ordered pair ( V , C ) where V is the vertex set of G and C is a set of k -cycles, the edges of which partition the edges of G . A k -cycle system of λ K v is known as a λ -fold k -cycle system of order v .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::748ffae4ba1338d875fb296ea0119619
https://doi.org/10.1016/j.disc.2014.12.022
https://doi.org/10.1016/j.disc.2014.12.022
Publikováno v:
Discrete Mathematics. 320:26-39
Necessary and sufficient conditions are established for an integer vector to be the f-vector of some pure simplicial complex of rank three, and also for an integer vector to be thef-vector of some pure simplicial multicomplex of rank three. For speci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e63a0d137e349bf0ed414b9cced99e71
https://doi.org/10.1016/j.disc.2013.12.001
https://doi.org/10.1016/j.disc.2013.12.001
Publikováno v:
Journal of Combinatorial Designs. 22:196-215
A k-cycle system of a multigraph G is an ordered pair (V, C) where V is the vertex set of G and C is a set of k-cycles, the edges of which partition the edges of G. A k-cycle system of is known as a λ-fold k-cycle system of order V. A k-cycle system
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edf2e35931d4285bf2d3e9d177d81517
https://doi.org/10.1002/jcd.21345
https://doi.org/10.1002/jcd.21345
Publikováno v:
ITiCSE
This paper describes a visualization tool AESvisual that helps students learn and instructors teach the AES cipher. The software allows the user to visualize all the major steps of AES encryption and decryption. The demo mode is useful and efficient
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da7b9443c4e78c8ebe0dd8d2fbe4f069
https://doi.org/10.1145/2899415.2899425
https://doi.org/10.1145/2899415.2899425
Autor:
Sibel Özkan, Melissa S. Keranen
Publikováno v:
Graphs and Combinatorics. 29:1827-1837
A 2-factor in a graph G is a 2-regular spanning subgraph of G, and a 2-factorization of G is a decomposition of all the edges of G into edge-disjoint 2-factors. A $${\{C_{m}^{r}, C_{n}^{s}\}}$$ -factorization of K ? asks for a 2-factorization of K ?
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b24c53a4f75fb17e11ecd462751665e7
https://doi.org/10.1007/s00373-012-1231-6
https://doi.org/10.1007/s00373-012-1231-6