Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Kevin N. Vander Meulen"'
Publikováno v:
The Electronic Journal of Linear Algebra. 35:223-247
Given a polynomial $p(z)$, a companion matrix can be thought of as a simple template for placing the coefficients of $p(z)$ in a matrix such that the characteristic polynomial is $p(z)$. The Frobenius companion and the more recently-discovered Fiedle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34e4d12a20a5232787074560529805e2
https://doi.org/10.13001/1081-3810.3839
https://doi.org/10.13001/1081-3810.3839
The $k$-token graph $T_k(G)$ is the graph whose vertices are the $k$-subsets of vertices of a graph $G$, with two vertices of $T_k(G)$ adjacent if their symmetric difference is an edge of $G$. We explore when $T_k(G)$ is a well-covered graph, that is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9490be6d66e68a7917a8ec7718a0f693
Publikováno v:
Discrete Mathematics. 341:3355-3369
We focus our attention on well-covered graphs that are vertex decomposable. We show that for many known families of these vertex decomposable graphs, the set of shedding vertices forms a dominating set. We then construct three new infinite families o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::847b097926f16920464cba334801ce79
https://doi.org/10.1016/j.disc.2018.07.029
https://doi.org/10.1016/j.disc.2018.07.029
Publikováno v:
The Electronic Journal of Linear Algebra. 32:317-344
This paper explores how the combinatorial arrangement of prescribed zeros in a matrix affects the possible eigenvalues that the matrix can obtain. It demonstrates that there are inertially arbitrary patterns having a digraph with no 2-cycle, unlike w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c25e79e39b0f14da8e49bc60be3b03ef
https://doi.org/10.13001/1081-3810.3436
https://doi.org/10.13001/1081-3810.3436
Publikováno v:
Experimental Mathematics. 25:441-451
We study the independence complexes of families of well-covered circulant graphs discovered by Boros-Gurvich-Milani\v{c}, Brown-Hoshino, and Moussi. Because these graphs are well-covered, their independence complexes are pure simplicial complexes. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5482624bdfdd892dbf548069c57365f3
https://doi.org/10.1080/10586458.2015.1091753
https://doi.org/10.1080/10586458.2015.1091753
The Frobenius companion matrix, and more recently the Fiedler companion matrices, have been used to provide lower and upper bounds on the modulus of any root of a polynomial p ( x ) . In this paper we explore new bounds obtained from taking the 1-nor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bae7084b9721a42a81af637a82544c5b
Publikováno v:
Communications in Algebra. 42:1896-1910
Let G be the circulant graph C n (S) with , and let I(G) denote the edge ideal in the ring R = k[x 1,…, x n ]. We consider the problem of determining when G is Cohen–Macaulay, i.e, R/I(G) is a Cohen–Macaulay ring. Because a Cohen–Macaulay gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6628ea83684da29b0f05b4d85ecc8cc7
https://doi.org/10.1080/00927872.2012.749886
https://doi.org/10.1080/00927872.2012.749886
Autor:
Brydon Eastman, Kevin N. Vander Meulen
Publikováno v:
Special Matrices, Vol 4, Iss 1 (2016)
The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutational
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92843796e257d1e6dad76520a7ae9e63
https://doi.org/10.1515/spma-2016-0003
https://doi.org/10.1515/spma-2016-0003
Autor:
Sebastian M. Cioabă, Michelle Markiewitz, Trevor Vanderwoerd, Kevin N. Vander Meulen, Randall J. Elzinga
Graham and Pollak showed that the vertices of any connected graph $G$ can be assigned $t$-tuples with entries in $\{0, a, b\}$, called addresses, such that the distance in $G$ between any two vertices equals the number of positions in their addresses
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be145fcf4a220cd5efcb08707a5f0852
A matrix pattern is often either a sign pattern with entries in { 0 , + , − } or, more simply, a nonzero pattern with entries in { 0 , ⁎ } . A matrix pattern A is spectrally arbitrary if for any choice of a real matrix spectrum, there is a real m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc0142f06af90872cde5c04bca6e6025