For the normalized Laplacian matrix it is possible for graphs with differing number of edges to have the same spectrum. This leads to the potential for there to be a tree and a non-tree which share the same spectrum and a well-known example of this are star graphs with other complete bipartite graphs. Previous to this work, this was the known infinite family with this property. We construct more families of graphs with this property
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
AbstractWe investigate how the spectrum of the normalized (geometric) graph Laplacian is affected by...
We present an infinite example of trees cospectral with respect to the normalized Laplacian and a us...
AbstractIn this paper, we show that if G is a starlike tree, then it is determined by its Laplacian ...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
Several researchers have recently explored various graph parameters that can or cannot be characteri...
Several researchers have recently explored various graph parameters that can or cannot be characteri...
Several researchers have recently explored various graph parameters that can or cannot be characteri...
Several researchers have recently explored various graph parameters that can or cannot be characteri...
Several researchers have recently explored various graph parameters that can or cannot be characteri...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniqu...
A spectral faux tree with respect to a given matrix is a graph which is not a tree but is cospectral...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
AbstractWe investigate how the spectrum of the normalized (geometric) graph Laplacian is affected by...
We present an infinite example of trees cospectral with respect to the normalized Laplacian and a us...
AbstractIn this paper, we show that if G is a starlike tree, then it is determined by its Laplacian ...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
AbstractLet M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian ...
Several researchers have recently explored various graph parameters that can or cannot be characteri...
Several researchers have recently explored various graph parameters that can or cannot be characteri...
Several researchers have recently explored various graph parameters that can or cannot be characteri...
Several researchers have recently explored various graph parameters that can or cannot be characteri...
Several researchers have recently explored various graph parameters that can or cannot be characteri...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniqu...
A spectral faux tree with respect to a given matrix is a graph which is not a tree but is cospectral...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
AbstractWe investigate how the spectrum of the normalized (geometric) graph Laplacian is affected by...