Zobrazeno 1 - 10
of 16
pro vyhledávání: '"David Sossa"'
Autor:
Abby E. Davis, Kaitlin R. Deutsch, Alondra M. Torres, Mesly J. Mata Loya, Lauren V. Cody, Emma Harte, David Sossa, Paige A. Muñiz, Wee Hao Ng, Scott H. McArt
Publikováno v:
Scientific Reports, Vol 11, Iss 1, Pp 1-10 (2021)
Abstract Flowers can be transmission platforms for parasites that impact bee health, yet bees share floral resources with other pollinator taxa, such as flies, that may be hosts or non-host vectors (i.e., mechanical vectors) of parasites. Here, we as
Externí odkaz:
https://doaj.org/article/da4c322bf759454ba5157db9bff954c8
Autor:
David Sossa
Publikováno v:
Linear Algebra and its Applications. 667:151-164
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a4366ef60b4eff71f5c8774a01d30d3
https://doi.org/10.1016/j.laa.2023.03.011
https://doi.org/10.1016/j.laa.2023.03.011
Autor:
Olivia Miller, Casey Hale, Leeah Richardson, David Sossa, Aaron Iverson, Scott McArt, Katja Poveda, Heather Grab
Publikováno v:
Journal of Applied Ecology. 60:592-600
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ccfcf6e0ba96acb9f16480ec0a8fe08
https://doi.org/10.1111/1365-2664.14353
https://doi.org/10.1111/1365-2664.14353
Autor:
Alberto Seeger, David Sossa
Publikováno v:
Linear and Multilinear Algebra. 71:63-87
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd7e29dcf5b0ad48b5da70371bb5c873
https://doi.org/10.1080/03081087.2021.2017836
https://doi.org/10.1080/03081087.2021.2017836
Autor:
Alberto Seeger, David Sossa
Publikováno v:
Linear and Multilinear Algebra. 70:5173-5192
This work examines different notions of similarity for a pair u, v of vertices of a graph G. The considered similarity notions are either of removal type or attachment type. In the removal case, ch...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::faea849f387aa8f3e1cd2bf576c68dcf
https://doi.org/10.1080/03081087.2021.1908943
https://doi.org/10.1080/03081087.2021.1908943
Autor:
Lauren V. Cody, Wee Hao Ng, Alondra M. Torres, Paige A. Muñiz, Abby E. Davis, David Sossa, Emma Harte, Scott H. McArt, Mesly J. Mata Loya, Kaitlin R. Deutsch
Publikováno v:
Scientific Reports
Scientific Reports, Vol 11, Iss 1, Pp 1-10 (2021)
Scientific Reports, Vol 11, Iss 1, Pp 1-10 (2021)
Flowers can be transmission platforms for parasites that impact bee health, yet bees share floral resources with other pollinator taxa, such as flies, that may be hosts or non-host vectors (i.e., mechanical vectors) of parasites. Here, we assessed wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e36dbc6a3206b9081c3f79c41f0971c
https://doi.org/10.1038/s41598-021-95323-w
https://doi.org/10.1038/s41598-021-95323-w
Autor:
Lauren V. Cody, Scott H. McArt, Wee Hao Ng, Alondra M. Torres, Abby E. Davis, David Sossa, Emma Harte, Mesly J. Mata Loya, Kaitlin R. Deutsch, Paige A. Muñiz
Flowers can be transmission platforms for parasites that impact bee health, yet bees share floral resources with other pollinator taxa, such as flies, that could be hosts or non-host vectors (i.e., mechanical vectors) of parasites. Here, we assessed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b683457867a7bd614a7339ad9a08dbd3
https://doi.org/10.21203/rs.3.rs-556537/v1
https://doi.org/10.21203/rs.3.rs-556537/v1
Autor:
David Sossa, Alberto Seeger
Publikováno v:
Linear Algebra and its Applications
Linear Algebra and its Applications, Elsevier, 2021, 614, pp.5-23. ⟨10.1016/j.laa.2019.11.012⟩
Linear Algebra and its Applications, Elsevier, 2021, 614, pp.5-23. ⟨10.1016/j.laa.2019.11.012⟩
This work deals with complementarity spectra of connected graphs and, specifically, with the associated concept of spectral capacity of a finite set of connected graphs. The cardinality of the complementarity spectrum of a connected graph G serves as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3976ef917ac928dabae7070a46c08d1
https://hal.archives-ouvertes.fr/hal-03356431
https://hal.archives-ouvertes.fr/hal-03356431
Autor:
David Sossa, Alberto Seeger
Publikováno v:
Graphs and Combinatorics
Graphs and Combinatorics, Springer Verlag, 2021, 37 (2), pp.493-525. ⟨10.1007/s00373-020-02260-y⟩
Graphs and Combinatorics, Springer Verlag, 2021, 37 (2), pp.493-525. ⟨10.1007/s00373-020-02260-y⟩
This work elaborates on the old problem of measuring the degree of similarity, say $${\mathfrak {f}}(G,H)$$ , between a pair of connected graphs G and H, not necessarily of the same order. The choice of a similarity index $${\mathfrak {f}}$$ depends
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15c2aa2441af3ddff5cb05ac8bf2cee8
https://hal.archives-ouvertes.fr/hal-03356426
https://hal.archives-ouvertes.fr/hal-03356426
Autor:
David Sossa, Alberto Seeger
Publikováno v:
Graphs and Combinatorics
Graphs and Combinatorics, Springer Verlag, 2020, 36 (1), pp.1-25. ⟨10.1007/s00373-019-02112-4⟩
Graphs and Combinatorics, Springer Verlag, 2020, 36 (1), pp.1-25. ⟨10.1007/s00373-019-02112-4⟩
This paper deals with various extremal problems involving two important parameters associated to a connected graph, say G. The first parameter is the largest complementarity eigenvalue: it is denoted by $$\varrho (G)$$ and it is simply the spectral r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aaf6630d573444fe4803f60f2d576778
https://hal.archives-ouvertes.fr/hal-03356639
https://hal.archives-ouvertes.fr/hal-03356639