We explore algebraic and spectral properties of weighted graphs containing twin vertices that are useful in quantum state transfer. We extend the notion of adjacency strong cospectrality to arbitrary Hermitian matrices, with focus on the generalized adjacency matrix and the generalized normalized adjacency matrix. We then determine necessary and sufficient conditions such that a pair of twin vertices in a weighted graph exhibits strong cospectrality with respect to the above-mentioned matrices. We also generalize known results about equitable and almost equitable partitions, and use these to determine which joins of the form $X\vee H$, where $X$ is either the complete or empty graph, exhibit strong cospectrality.Comment: 25 pages, 6 figure
A weak Hadamard matrix is a $\{-1,0, 1\}$-matrix $P$ such that $PP^T$ is tridiagonal. We explore the...
We investigate the equivalence between spectral characteristics of the Laplace operator on a metric ...
We prove that no tree contains a set of three vertices which are pairwise strongly cospectral. This ...
This thesis is a study of two graph properties that arise from quantum walks: strong cospectrality o...
We formalize the notion of a sedentary vertex and present a relaxation of the concept of a sedentary...
We consider matrices of the form $qD+A$, with $D$ being the diagonal matrix of degrees, $A$ being th...
Twin vertices of a graph have the same open neighbourhood. If they are not adjacent, then they are ...
We introduce a switching operation, inspired by the Godsil-McKay switching, in order to obtain pairs...
This thesis studies the transition matrix of a quantum walk on strongly regular graphs. It is propos...
AbstractLet J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old resul...
We define $G$-cospectrality of two $G$-gain graphs $(\Gamma,\psi)$ and $(\Gamma',\psi')$, proving th...
We consider quantum state transfer on finite graphs which are attached to infinite paths. The finite...
We investigate spectral properties of periodic quantum graphs in the form of a kagome or a triangula...
AbstractThe notion of a (1, x) adjacency matrix is introduced, together with methods for dealing wit...
Let X be a graph, A its adjacency matrix, and t a non-negative real number. The matrix exp(i t A) de...
A weak Hadamard matrix is a $\{-1,0, 1\}$-matrix $P$ such that $PP^T$ is tridiagonal. We explore the...
We investigate the equivalence between spectral characteristics of the Laplace operator on a metric ...
We prove that no tree contains a set of three vertices which are pairwise strongly cospectral. This ...
This thesis is a study of two graph properties that arise from quantum walks: strong cospectrality o...
We formalize the notion of a sedentary vertex and present a relaxation of the concept of a sedentary...
We consider matrices of the form $qD+A$, with $D$ being the diagonal matrix of degrees, $A$ being th...
Twin vertices of a graph have the same open neighbourhood. If they are not adjacent, then they are ...
We introduce a switching operation, inspired by the Godsil-McKay switching, in order to obtain pairs...
This thesis studies the transition matrix of a quantum walk on strongly regular graphs. It is propos...
AbstractLet J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old resul...
We define $G$-cospectrality of two $G$-gain graphs $(\Gamma,\psi)$ and $(\Gamma',\psi')$, proving th...
We consider quantum state transfer on finite graphs which are attached to infinite paths. The finite...
We investigate spectral properties of periodic quantum graphs in the form of a kagome or a triangula...
AbstractThe notion of a (1, x) adjacency matrix is introduced, together with methods for dealing wit...
Let X be a graph, A its adjacency matrix, and t a non-negative real number. The matrix exp(i t A) de...
A weak Hadamard matrix is a $\{-1,0, 1\}$-matrix $P$ such that $PP^T$ is tridiagonal. We explore the...
We investigate the equivalence between spectral characteristics of the Laplace operator on a metric ...
We prove that no tree contains a set of three vertices which are pairwise strongly cospectral. This ...