Zobrazeno 1 - 10
of 103
pro vyhledávání: '"C, Bunge"'
Autor:
Casey C. Bunge, MD, Prarthana J. Dalal, MD, PhD, Elizabeth Gray, MS, Kasen Culler, MD, Julia J. Brown, MD, Susan E. Quaggin, MD, Anand Srivastava, MD, MPH, Manjot K. Gill, MD
Publikováno v:
Ophthalmology Science, Vol 3, Iss 4, Pp 100326- (2023)
Purpose: To examine whether patients with diabetic retinopathy receiving intravitreal anti-VEGF injections are at increased risk of kidney function decline. Design: Retrospective cohort study. Participants: Included 187 patients who received intravit
Externí odkaz:
https://doaj.org/article/3a394ef76e17499592334e84e505ae21
Autor:
Amber Armstrong, Ryan C. Bunge, William Duncan, Saad I. El-Zanati, Kristin Koe, Rachel Stutzman
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 451-468 (2021)
A symmetric triple-hyperstar is a connected, 3-uniform hypergraph where, for some edge {a, b, c}, vertices a, b, and c all have degree k > 1 and all other edges contain exactly 2 vertices of degree 1. Let H denote the symmetric triple-hyperstar with
Externí odkaz:
https://doaj.org/article/5ff2599d9a8243f19ff637ead690e4ef
Autor:
Ryan C. Bunge, Dontez Collins, Daryl Conko-Camel, Saad I. El-Zanati, Rachel Liebrecht, Alexander Vasquez
Publikováno v:
Opuscula Mathematica, Vol 40, Iss 2, Pp 209-225 (2020)
It is known that the 3-uniform loose 3-cycle decomposes the complete 3-uniform hypergraph of order \(v\) if and only if \(v \equiv 0, 1,\text{ or }2\ (\operatorname{mod} 9)\). For all positive integers \(\lambda\) and \(v\), we find a maximum packing
Externí odkaz:
https://doaj.org/article/992bf3571009446b95ae5be388714911
Autor:
Ryan C. Bunge
Publikováno v:
Opuscula Mathematica, Vol 39, Iss 5, Pp 623-643 (2019)
Consider a tripartite graph to be any simple graph that admits a proper vertex coloring in at most 3 colors. Let \(G\) be a tripartite graph with \(n\) edges, one of which is a pendent edge. This paper introduces a labeling on such a graph \(G\) used
Externí odkaz:
https://doaj.org/article/f4f1fe52af1e40eb91027fd49d338114
Autor:
Ryan C. Bunge, Steven DeShong, Saad I. El-Zanati, Alexander Fischer, Dan P. Roberts, Lawrence Teng
Publikováno v:
Opuscula Mathematica, Vol 38, Iss 1, Pp 15-30 (2018)
The paw graph consists of a triangle with a pendant edge attached to one of the three vertices. We obtain a multigraph by adding exactly one repeated edge to the paw. Now, let \(D\) be a directed graph obtained by orientating the edges of that multig
Externí odkaz:
https://doaj.org/article/2303584e616845759de51ddc761c31b2
Autor:
Ryan C. Bunge, Saad I. El-Zanati, William Duncan, Amber Armstrong, Kristin Koe, Rachel Stutzman
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 451-468 (2021)
A symmetric triple-hyperstar is a connected, 3-uniform hypergraph where, for some edge {a, b, c}, vertices a, b, and c all have degree k > 1 and all other edges contain exactly 2 vertices of degree 1. Let H denote the symmetric triple-hyperstar with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95534655fb30d6d9cb7a71be2c51375d
https://ejgta.org/index.php/ejgta/article/view/925
https://ejgta.org/index.php/ejgta/article/view/925
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Casey C. Bunge, Prarthana J. Dalal, Elizabeth Gray, Kasen Culler, Julia J. Brown, Susan E. Quaggin, Anand Srivastava, Manjot K. Gill
Publikováno v:
Ophthalmology Science. :100326
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::799ebf7006b2b123df03900b98d23ca1
https://doi.org/10.1016/j.xops.2023.100326
https://doi.org/10.1016/j.xops.2023.100326
Autor:
Dontez Collins, Alexander Vasquez, Ryan C. Bunge, Daryl Conko-Camel, Saad I. El-Zanati, Rachel Liebrecht
Publikováno v:
Opuscula Mathematica, Vol 40, Iss 2, Pp 209-225 (2020)
It is known that the 3-uniform loose 3-cycle decomposes the complete 3-uniform hypergraph of order \(v\) if and only if \(v \equiv 0, 1,\text{ or }2 (\operatorname{mod} 9)\). For all positive integers \(\lambda\) and \(v\), we find a maximum packing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c08715fd963595c08ee156a233baa904
https://www.opuscula.agh.edu.pl/vol40/2/art/opuscula_math_4011.pdf
https://www.opuscula.agh.edu.pl/vol40/2/art/opuscula_math_4011.pdf
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9783031053740
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ca7088b909b0eef6124c0400b5b7ea2
https://doi.org/10.1007/978-3-031-05375-7_6
https://doi.org/10.1007/978-3-031-05375-7_6
