AbstractCirculant graphs satisfying det(−A(G))=−deg(G) are used to construct arbitrarily large families of graphs with determinant equal to that of the complete graph Kn
AbstractOne method for counting weighted cycle systems in a graph entails taking the determinant of ...
Identifying and locating-dominating codes have been widely studied in circulant graphs of type Cn(1,...
AbstractA graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
AbstractCirculant graphs satisfying det(−A(G))=−deg(G) are used to construct arbitrarily large famil...
AbstractA family of n×n symmetric circulant (0, 1) matrices is studied. It is shown that the determi...
AbstractProperties of a graph (directed or undirected) whose adjacency matrix is a circulant are stu...
AbstractLet G be a unicyclic graph with n vertices and the unique cycle C, A(G) and N(G) its adjacen...
AbstractWe investigate a certain condition for isomorphism between circulant graphs (known as the Ád...
We introduce the concept of codeterminantal graphs, which generalize the concepts of cospectral and ...
AbstractWe consider the problem of computing the permanent of circulant matrices. We apply some rece...
AbstractIn this note we characterize integral graphs among circulant graphs. It is conjectured that ...
AbstractWe obtain upper and lower bounds on the average energy of circulant graphs with n vertices a...
We consider the problem of computing the permanent of circulant matrices. We apply some recent resul...
In this thesis, we apply spectral graph theory to show the non-existence of an expander family withi...
AbstractIn this paper we develop a method for determining the exact number of spanning trees in (dir...
AbstractOne method for counting weighted cycle systems in a graph entails taking the determinant of ...
Identifying and locating-dominating codes have been widely studied in circulant graphs of type Cn(1,...
AbstractA graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
AbstractCirculant graphs satisfying det(−A(G))=−deg(G) are used to construct arbitrarily large famil...
AbstractA family of n×n symmetric circulant (0, 1) matrices is studied. It is shown that the determi...
AbstractProperties of a graph (directed or undirected) whose adjacency matrix is a circulant are stu...
AbstractLet G be a unicyclic graph with n vertices and the unique cycle C, A(G) and N(G) its adjacen...
AbstractWe investigate a certain condition for isomorphism between circulant graphs (known as the Ád...
We introduce the concept of codeterminantal graphs, which generalize the concepts of cospectral and ...
AbstractWe consider the problem of computing the permanent of circulant matrices. We apply some rece...
AbstractIn this note we characterize integral graphs among circulant graphs. It is conjectured that ...
AbstractWe obtain upper and lower bounds on the average energy of circulant graphs with n vertices a...
We consider the problem of computing the permanent of circulant matrices. We apply some recent resul...
In this thesis, we apply spectral graph theory to show the non-existence of an expander family withi...
AbstractIn this paper we develop a method for determining the exact number of spanning trees in (dir...
AbstractOne method for counting weighted cycle systems in a graph entails taking the determinant of ...
Identifying and locating-dominating codes have been widely studied in circulant graphs of type Cn(1,...
AbstractA graph is called magic (supermagic) if it admits a labelling of the edges by pairwise diffe...
DOI
Add to ORKG