Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Kristin Heysse"'
Publikováno v:
Linear Algebra and Its Applications, 650, 1-25. Elsevier
We introduce the concept of codeterminantal graphs, which generalize the concepts of cospectral and coinvariant graphs. To do this, we investigate the relationship of the spectrum and the Smith normal form (SNF) with the determinantal ideals. We esta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91e66a1a83e259fb59bf209b5fc9113a
https://doi.org/10.1016/j.laa.2022.05.021
https://doi.org/10.1016/j.laa.2022.05.021
Autor:
Brent Moran, Paul Horn, Steve Butler, Jay Cummings, Zhanar Berikkyzy, Kristin Heysse, Ruth Luo
Publikováno v:
Discrete Mathematics. 341:497-507
Consider the following process on a simple graph without isolated vertices: order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in some preceding edge. The resulting set of edges forms a spanning fores
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bb6c9283a3ff03ba221cffa34d024b6
https://doi.org/10.1016/j.disc.2017.09.017
https://doi.org/10.1016/j.disc.2017.09.017
Publikováno v:
Discrete Mathematics. 341:492-496
For two graphs G and H , the Turan number ex ( G , H ) is the maximum number of edges in a subgraph of G that contains no copy of H . Chen, Li, and Tu determined the Turan numbers ex ( K m , n , k K 2 ) for all k ≥ 1 Chen et al. (2009). In this pap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a9f744b237724b55f73fa806b59fb9a
https://doi.org/10.1016/j.disc.2017.09.016
https://doi.org/10.1016/j.disc.2017.09.016
Autor:
Kristin Heysse
Publikováno v:
Linear Algebra and its Applications. 535:195-212
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in their edg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e90238ed3ee4773326eb5abf2d77526b
https://doi.org/10.1016/j.laa.2017.09.005
https://doi.org/10.1016/j.laa.2017.09.005
The order ideal $B_{n,2}$ of the Boolean lattice $B_n$ consists of all subsets of size at most $2$. Let $F_{n,2}$ denote the poset refinement of $B_{n,2}$ induced by the rules: $i < j$ implies $\{i \} \prec \{ j \}$ and $\{i,k \} \prec \{j,k\}$. We g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11bf189370f8544c8462aa1ac25c4db3
Autor:
Leslie Hogben, Michael Tait, Jephian C.-H. Lin, Jessica De Silva, Aida Abiad, Kristin Heysse, Ghodratollah Aalipour, Jay Cummings, Franklin H. J. Kenter, Zhanar Berikkyzy, Wei Gao
Publikováno v:
Linear Algebra and Its Applications, 497, 66-87. Elsevier Science
The distance matrix of a graph $G$ is the matrix containing the pairwise distances between vertices. The distance eigenvalues of $G$ are the eigenvalues of its distance matrix and they form the distance spectrum of $G$. We determine the distance spec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72c61cafe9a3d03cb1af3dc07ad6f2b5
Autor:
Kristin Heysse, Steve Butler
We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral graphs with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::80e906b234a0892dec01c417d848fbb9
Publikováno v:
The European Physical Journal Plus. 126
To approximate solutions of a linear differential equation, we project, via trigonometric interpolation, its solution space onto a finite-dimensional space of trigonometric polynomials and construct a matrix representation of the differential operato
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac680fac1922fe802b9b64be33573a86
https://doi.org/10.1140/epjp/i2011-11097-5
https://doi.org/10.1140/epjp/i2011-11097-5