Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Jessica, McDonald"'
Publikováno v:
Theory and Applications of Graphs, Vol 8, Iss 2 (2021)
In any graph $G$, the domination number $\gamma(G)$ is at most the independence number $\alpha(G)$. The \emph{Inverse Domination Conjecture} says that, in any isolate-free $G$, there exists pair of vertex-disjoint dominating sets $D, D'$ with $|D|=\g
Externí odkaz:
https://doaj.org/article/a781f4f3bd8947448ccf77849beb240d
Autor:
Jessica McDonald
Publikováno v:
Engaged Scholar Journal, Vol 6, Iss 2 (2021)
Externí odkaz:
https://doaj.org/article/7e095b9a9de64508b3d947c11887523c
Autor:
Kanokporn Pinyopornpanish, Sanhapan Thanamee, Wichuda Jiraporncharoen, Kanittha Thaikla, Jessica McDonald, Apinun Aramrattana, Chaisiri Angkurawaranon
Publikováno v:
BMC Research Notes, Vol 10, Iss 1, Pp 1-8 (2017)
Abstract Background Sexual health is one of the key dimensions of health across all ages. Understanding risky sexual behaviors remains an important area of public health research. This study aimed to explore sexual health, risky sexual behaviors and
Externí odkaz:
https://doaj.org/article/5526de61815842fe85761d00c1608aee
Autor:
Filipe Espinheira Gomes, Maria Isabel Casanova, Lara Mouttham, Danika L. Bannasch, Sangwan Park, Soohyun Kim, Laura J. Young, Nicole L. Daley, Sara M. Thomasy, Marta G. Castelhano, Eric C. Ledbetter, Bradford Holmberg, Ryan Boyd, Alexandra Van Der Woerdt, Jessica McDonald, Jessica J. Hayward
Publikováno v:
American Journal of Veterinary Research. :1-8
OBJECTIVE To identify genetic associations with primary glaucoma (PG) in American Cocker Spaniels using a genome-wide association study (GWAS). ANIMALS A nationwide ambidirectional case–control cohort study was performed in American Cocker Spaniels
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf7283b17a2b05cada5a3a08116992ab
https://doi.org/10.2460/ajvr.22.07.0106
https://doi.org/10.2460/ajvr.22.07.0106
Publikováno v:
Engaged Scholar Journal, Vol 4, Iss 1 (2018)
This special issue invites engaged learning practitioners and scholars, both established and emerging, to take stock of the history of CSL, assess current practices, and consider how to move forward in the future. Is CSL the biggest thing to hit Cana
Externí odkaz:
https://doaj.org/article/afdf80242b81432388af5218a6f19957
Autor:
Mirsada Causevic, Kristina Dominko, Martina Malnar, Lea Vidatic, Stjepko Cermak, Martina Pigoni, Peer-Hendrik Kuhn, Alessio Colombo, Daniel Havas, Stefanie Flunkert, Jessica McDonald, Jenny M Gunnersen, Birgit Hutter-Paier, Sabina Tahirovic, Manfred Windisch, Dimitri Krainc, Stefan F Lichtenthaler, Silva Hecimovic
Publikováno v:
PLoS ONE, Vol 13, Iss 7, p e0200344 (2018)
It is intriguing that a rare, inherited lysosomal storage disorder Niemann-Pick type C (NPC) shares similarities with Alzheimer's disease (AD). We have previously reported an enhanced processing of β-amyloid precursor protein (APP) by β-secretase (
Externí odkaz:
https://doaj.org/article/1789a778f74f4473b3cee534b11a03e1
Publikováno v:
Theory and Applications of Graphs, Vol 4, Iss 2 (2017)
An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prove the following: If n, k, and t are integers satisfying n ≥ k ≥ t ≥ 3 and k ≤ 2t - 2, and G is a graph with the minimum number of edges among
Externí odkaz:
https://doaj.org/article/28b7bdd788a24e6ba2628980713b609b
Publikováno v:
Journal of Canadian Studies. 54:153-180
This article presents a framework for identifying and analyzing the Newfoundland master narrative, a narrative that is powerful and persistent in Newfoundland literature, its marketing, and its popular and critical reception. This master narrative pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0aa8eeffb9a47a3b9ec28d3f1a4f85bb
https://doi.org/10.3138/jcs-2019-0019
https://doi.org/10.3138/jcs-2019-0019
Publikováno v:
Graphs and Combinatorics. 36:1059-1063
We prove that if a directed multigraph $D$ has at most $t$ pairwise arc-disjoint directed triangles, then there exists a set of less than $2t$ arcs in $D$ which meets all directed triangles in $D$, except in the trivial case $t=0$. This answers affir
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa301b39b9d301ba4cb6340988bb7bbf
https://doi.org/10.1007/s00373-020-02167-8
https://doi.org/10.1007/s00373-020-02167-8
Autor:
Jessica McDonald, Gregory J. Puleo
Publikováno v:
Journal of Graph Theory. 95:165-180
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8480715a38575b00fb6b0c22196e0c11
https://doi.org/10.1002/jgt.22552
https://doi.org/10.1002/jgt.22552