Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Robert F. Bailey"'
Autor:
Robert F. Bailey, Karen Meagher
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 13 no. 4 (2012)
special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity
Externí odkaz:
https://doaj.org/article/a2221db58f4c4cc9a31844154e95173c
Autor:
Kelly J. Abrams, Julia Adler-Milstein, Atif Al Braiki, Hamed Al Hashemi, Katie S. Allen, Chinedu Aniekwe, Eyasu Ashebier, Gonfa Ayana, Robert F. Bailey, Cristina Barboi, Adebobola Bashorun, Ofir Ben-Assuli, Paul G. Biondich, Kenneth S. Boockvar, Jack Bowie, David Broyles, Ryan Crichton, Caitlin M. Cusack, Ibrahim Dalhatu, Ahmed Deeb, Yaron Denekamp, Brian E. Dixon, Luke Duncan, Sue S. Feldman, Ammon R. Fillmore, Carl Fourie, Emily Franzosa, Candace J. Gibson, Nora J. Gilliam, Rahul Goyal, Shaun J. Grannis, Randall W. Grout, Saira N. Haque, David Horrocks, Bob Jolliffe, Pallavi Jonnalagadda, John P. Kansky, Andrew S. Kanter, James M. Kariuki, David C. Kendrick, Hadi Kharrazi, Ramona Kyabaggu, Bisera Lakinska, Li-Hui Lee, Burke W. Mamlin, Eric-Jan Manders, J. Marc Overhage, Erika G. Martin, Timothy D. McFarlane, Carl D. McKinley, Melissa McPheeters, Nir Menachemi, Teryn P. Morgan, Bedri Ahmed Mumme, Lisa A. Murie, Kalechristos Abebe Negussie, Christian Nøhr, Charles Nzelu, Martin Osumba, Mitchell Parker, Asaminew Petros, Saurabh Rahurkar, Drew Richardson, Todd M. Rogow, Johan Ivar Sæbø, Thomas Schmidt, Minen Sead, Rita Sembajwe, Dykki Settle, Jennifer Shivers, Catherine J. Staes, Eileen F. Tallman, Willi L. Tarver, Scott Teesdale, Japjit Kaur Tutt, Elizabeth E. Umberfield, Nimish Valvi, Joshua R. Vest, Jonathan Weiner, Hsyien-Chia Wen, Dereje Woldehanna, Chantal Worzala
Publikováno v:
Health Information Exchange ISBN: 9780323908023
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::822250d8a334bbe46ef2fa1fbed2fd61
https://doi.org/10.1016/b978-0-323-90802-3.00037-x
https://doi.org/10.1016/b978-0-323-90802-3.00037-x
Autor:
Robert F. Bailey, Pablo Spiga
A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension $\mu(\Gamma)$ is the smallest size of a resolv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::200b7e5219d92005d3d88d8fadaa9bb4
https://hdl.handle.net/10281/415959
https://hdl.handle.net/10281/415959
Autor:
Robert F. Bailey, Daniel R. Hawtin
A code $C$ in the Hamming metric, that is, is a subset of the vertex set $V\varGamma$ of the Hamming graph $\varGamma=H(m,q)$, gives rise to a natural distance partition $\{C,C_1,\ldots,C_\rho\}$, where $\rho$ is the covering radius of $C$. Such a co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::611ddd5495d72aabccbb12778510d26d
Autor:
Kelly L Robertson, Anahita Mostaghim, Christina A Cuomo, Carissa M Soto, Nikolai Lebedev, Robert F Bailey, Zheng Wang
Publikováno v:
PLoS ONE, Vol 7, Iss 11, p e48674 (2012)
Observations of enhanced growth of melanized fungi under low-dose ionizing radiation in the laboratory and in the damaged Chernobyl nuclear reactor suggest they have adapted the ability to survive or even benefit from exposure to ionizing radiation.
Externí odkaz:
https://doaj.org/article/84f1d2666fe544c4ba13207bb012b9a5
Autor:
Robert F. Bailey, Ismael G. Yero
Publikováno v:
Discussiones Mathematicae Graph Theory 39 (2019) 341–355
Discussiones Mathematicae Graph Theory, Vol 39, Iss 2, Pp 341-355 (2019)
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
instname
Discussiones Mathematicae Graph Theory, Vol 39, Iss 2, Pp 341-355 (2019)
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
instname
We demonstrate a construction of error-correcting codes from graphs by means of $k$-resolving sets, and present a decoding algorithm which makes use of covering designs. Along the way, we determine the $k$-metric dimension of grid graphs (i.e. Cartes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66c548640a6039170e305060586f6d4d
http://hdl.handle.net/10498/21882
http://hdl.handle.net/10498/21882
Autor:
R. Craigen, Robert F. Bailey
We consider real orthogonal $n\times n$ matrices whose diagonal entries are zero and off-diagonal entries nonzero, which we refer to as $\mathrm{OMZD}(n)$. We show that there exists an $\mathrm{OMZD}(n)$ if and only if $n\neq 1,\ 3$, and that a symme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ff4b673804da10e483347d50e70cffa
Autor:
Robert F. Bailey
A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension $\mu(\Gamma)$ is the smallest size of a resolv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1abd2c48bfc1676e15e8c7b1d2f53993
Autor:
Andrea Burgess, Robert F. Bailey
Publikováno v:
Discrete Mathematics. 313:1167-1190
Generalized t -designs, which form a common generalization of objects such as t -designs, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of t -designs, Discrete Math. 309 (2009) 4835–4842]. In this
Autor:
Peter J. Cameron, Robert F. Bailey
Publikováno v:
Bulletin of the London Mathematical Society. 43:209-242
The base size of a permutation group, and the metric dimension of a graph, are two of a number of related parameters of groups, graphs, coherent configurations and association schemes. They have been repeatedly re-defined with different terminology i