DOIAbstract
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
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
A Cayley graph on a group Γ with the generating set S ⊂ Γ is a graph costructed out of Γ. A circulan...
An approach for constructing and optimizing graphs of series of analytically described circulant gra...
AbstractA graph is well-covered if every independent set can be extended to a maximum independent se...
AbstractCirculant graphs satisfying det(−A(G))=−deg(G) are used to construct arbitrarily large famil...
Identifying and locating-dominating codes have been studied widely in circulant graphs. Recently, Vi...
We introduce the concept of codeterminantal graphs, which generalize the concepts of cospectral and ...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
AbstractA family of n×n symmetric circulant (0, 1) matrices is studied. It is shown that the determi...
A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or i...
Identifying and locating-dominating codes have been widely studied incirculant graphs of type $C_n(1...
AbstractWe determine families of circulant graphs for which each graph G=Gc(n;S) has chromatic numbe...
This thesis presents how Coates and Konig digraphs were applied to determinants. Each of these digra...
AbstractWe investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(...
The line graph of G, denoted L(G), is the graph with vertex set E(G), where vertices x and y are adj...
A digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with ...
A Cayley graph on a group Γ with the generating set S ⊂ Γ is a graph costructed out of Γ. A circulan...
An approach for constructing and optimizing graphs of series of analytically described circulant gra...
AbstractA graph is well-covered if every independent set can be extended to a maximum independent se...
AbstractCirculant graphs satisfying det(−A(G))=−deg(G) are used to construct arbitrarily large famil...
Identifying and locating-dominating codes have been studied widely in circulant graphs. Recently, Vi...
We introduce the concept of codeterminantal graphs, which generalize the concepts of cospectral and ...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
AbstractA family of n×n symmetric circulant (0, 1) matrices is studied. It is shown that the determi...
A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or i...
Identifying and locating-dominating codes have been widely studied incirculant graphs of type $C_n(1...
AbstractWe determine families of circulant graphs for which each graph G=Gc(n;S) has chromatic numbe...
This thesis presents how Coates and Konig digraphs were applied to determinants. Each of these digra...
AbstractWe investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(...
The line graph of G, denoted L(G), is the graph with vertex set E(G), where vertices x and y are adj...
A digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with ...
A Cayley graph on a group Γ with the generating set S ⊂ Γ is a graph costructed out of Γ. A circulan...
An approach for constructing and optimizing graphs of series of analytically described circulant gra...
AbstractA graph is well-covered if every independent set can be extended to a maximum independent se...
Add to ORKG