Add to ORKGAbstract. Let n be any positive integer, the friendship graph Fn consists of n edge-disjoint triangles that all of them meeting in one vertex. A graph G is called cospectral with a graph H if their adjacency matrices have the same eigenvalues. Recently i
A well-known fact in Spectral Graph Theory is the existence of pairs of cospectral (or isospectral) ...
In graph theory, the Friendship Theorem states that any finite graph in which every two vertices sha...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
Abstract. Let n be any positive integer and Fn be the friendship (or Dutch windmill) graph with 2n+1...
We determine all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included)...
For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same ...
For vertex- and edge-connectivity we construct infinitely many pairs of regular graphs with the same...
We present enumeration results on the number of connected graphs up to 10 vertices for which there i...
AbstractLet J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old resul...
AbstractWe have enumerated all graphs on at most 11 vertices and determined their spectra with respe...
1 There is a unique friendship two-graph? Definition 1 A friendship graph is a graph in which every ...
AbstractThe notion of a (1, x) adjacency matrix is introduced, together with methods for dealing wit...
The pineapple graph is obtained by appending q pendant edges to a vertex of a complete graph. We pro...
Let J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old result of Joh...
Let J be the all-ones rnatrix, and let A denote the adjacency matrix of a graph. An old result of Jo...
A well-known fact in Spectral Graph Theory is the existence of pairs of cospectral (or isospectral) ...
In graph theory, the Friendship Theorem states that any finite graph in which every two vertices sha...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
Abstract. Let n be any positive integer and Fn be the friendship (or Dutch windmill) graph with 2n+1...
We determine all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included)...
For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same ...
For vertex- and edge-connectivity we construct infinitely many pairs of regular graphs with the same...
We present enumeration results on the number of connected graphs up to 10 vertices for which there i...
AbstractLet J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old resul...
AbstractWe have enumerated all graphs on at most 11 vertices and determined their spectra with respe...
1 There is a unique friendship two-graph? Definition 1 A friendship graph is a graph in which every ...
AbstractThe notion of a (1, x) adjacency matrix is introduced, together with methods for dealing wit...
The pineapple graph is obtained by appending q pendant edges to a vertex of a complete graph. We pro...
Let J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old result of Joh...
Let J be the all-ones rnatrix, and let A denote the adjacency matrix of a graph. An old result of Jo...
A well-known fact in Spectral Graph Theory is the existence of pairs of cospectral (or isospectral) ...
In graph theory, the Friendship Theorem states that any finite graph in which every two vertices sha...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...