Add to ORKGWe found the characteristic polynomials for all graphs on 12 vertices, and report statistics related to the number of cospectral graphs
AbstractThis paper contains a table of 112 connected graphs on six vertices. The graphs are ordered ...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguis...
We found the characteristic polynomials for all graphs on 12 vertices, and report statistics related...
AbstractWe have enumerated all graphs on at most 11 vertices and determined their spectra with respe...
This paper provides a contribution to the study the phenomenon of cospectrality in generalized line ...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
AbstractThe article surveys the relationship between the characteristic polynomial of a graph G and ...
We present enumeration results on the number of connected graphs up to 10 vertices for which there i...
Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1...
Abstract. Let n be any positive integer, the friendship graph Fn consists of n edge-disjoint triangl...
AbstractA tree which has exactly one vertex of degree greater than two is said to be starlike. In sp...
AbstractLet J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old resul...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135469/1/blms0321.pd
AbstractThis paper contains a table of 112 connected graphs on six vertices. The graphs are ordered ...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguis...
We found the characteristic polynomials for all graphs on 12 vertices, and report statistics related...
AbstractWe have enumerated all graphs on at most 11 vertices and determined their spectra with respe...
This paper provides a contribution to the study the phenomenon of cospectrality in generalized line ...
AbstractLet ϕ(G,λ) be the characteristic polynomial of a graph G. Two graphs G and H are cospectral,...
AbstractThe article surveys the relationship between the characteristic polynomial of a graph G and ...
We present enumeration results on the number of connected graphs up to 10 vertices for which there i...
Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1...
Abstract. Let n be any positive integer, the friendship graph Fn consists of n edge-disjoint triangl...
AbstractA tree which has exactly one vertex of degree greater than two is said to be starlike. In sp...
AbstractLet J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old resul...
Graphs with the same spectrum are called cospectral. A graph is determined by its spectrum if every ...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135469/1/blms0321.pd
AbstractThis paper contains a table of 112 connected graphs on six vertices. The graphs are ordered ...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguis...