Add to ORKGWe construct graphs that are cospectral but nonisomorphic with Kneser graphs K(n, k), when n = 3k − 1, k> 2 and for infinitely many other pairs (n, k). We also prove that for 3 ≤ k ≤ n − 3 the Modulo-2 Kneser graph K2(n, k) is not determined by the spectrum
For a graph Gamma with adjacency matrix A, we consider a switching operation that takes Gamma into a...
We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniqu...
Abstract: For a graph Γ with adjacency matrix A, we consider a switching operation that takes Γ into...
In this paper some new methods of constructing infinite families of cospeetral graphs are presented....
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
AbstractThe k-th power of an n-vertex graph X is the iterated cartesian product of X with itself. Th...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
Abstract. Let n be any positive integer and Fn be the friendship (or Dutch windmill) graph with 2n+1...
Several researchers have recently explored various graph parameters that can or cannot be characteri...
A well-known fact in Spectral Graph Theory is the existence of pairs of cospectral (or isospectral) ...
For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same ...
AbstractLet H(n;q,n1,n2) be a graph with n vertices containing a cycle Cq and two hanging paths Pn1 ...
For vertex- and edge-connectivity we construct infinitely many pairs of regular graphs with the same...
We show that the q-Kneser graph $qK_{2k:k}$ (the graph on the k-subspaces of a 2k-space over GF(q), ...
AbstractThis paper proves that for any positive integer n, if m is large enough, then the reduced Kn...
For a graph Gamma with adjacency matrix A, we consider a switching operation that takes Gamma into a...
We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniqu...
Abstract: For a graph Γ with adjacency matrix A, we consider a switching operation that takes Γ into...
In this paper some new methods of constructing infinite families of cospeetral graphs are presented....
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
AbstractThe k-th power of an n-vertex graph X is the iterated cartesian product of X with itself. Th...
Spectral graph theory studies the relation between structural properties of a graph and the eigenval...
Abstract. Let n be any positive integer and Fn be the friendship (or Dutch windmill) graph with 2n+1...
Several researchers have recently explored various graph parameters that can or cannot be characteri...
A well-known fact in Spectral Graph Theory is the existence of pairs of cospectral (or isospectral) ...
For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same ...
AbstractLet H(n;q,n1,n2) be a graph with n vertices containing a cycle Cq and two hanging paths Pn1 ...
For vertex- and edge-connectivity we construct infinitely many pairs of regular graphs with the same...
We show that the q-Kneser graph $qK_{2k:k}$ (the graph on the k-subspaces of a 2k-space over GF(q), ...
AbstractThis paper proves that for any positive integer n, if m is large enough, then the reduced Kn...
For a graph Gamma with adjacency matrix A, we consider a switching operation that takes Gamma into a...
We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniqu...
Abstract: For a graph Γ with adjacency matrix A, we consider a switching operation that takes Γ into...