AbstractWe introduce a method of division of vectors to extend the definitions of de Bruijn graphs and Kautz graphs. Basic properties of extended de Bruijn graphs and extended Kautz graphs are given and finally several new results on isomorphic factorization of those graphs are given
This master’s thesis in graph theory focuses on graph decomposition. In practice, various forms of g...
Motivated by the work on the domination number of directed de Bruijn graphsand some of its generaliz...
AbstractGiven a Cartesian product G = G1 × … × Gm (m ⩾ 2) of nontrivial connected graphs Gi and the ...
AbstractWe introduce a method of division of vectors to extend the definitions of de Bruijn graphs a...
AbstractIn this paper, we present several relations among the Kronecker product, the line digraph op...
AbstractWe give here a complete description of the spectrum of de Bruijn and Kautz graphs. It is wel...
We study the Kronecker product of generalized de Bruijn digraphs. It is shown that the binary genera...
In this paper, we investigate isomorphic factorizations of the Kronecker product graphs. Using these...
AbstractA new way to expand De Bruijn and Kautz graphs is presented. It consists of deleting superfl...
AbstractIn this paper, we prove the existence of ranking and unranking algorithms on d-ary de Bruijn...
AbstractDe Bruijn and Kautz graphs have been intensively studied as perspective interconnection netw...
AbstractIn this paper we define the De Bruijn digraphs B(D,m) and the Kautz digraphs K(D,m) of a dig...
International audienceMotivated by the work on the domination number of directed de Bruijn graphs an...
In this paper, we investigate isomorphic factorizations of the Kronecker product graphs. Using these...
AbstractThe Good-de Bruijn graph was originally defined to settle a question of existence of a certa...
This master’s thesis in graph theory focuses on graph decomposition. In practice, various forms of g...
Motivated by the work on the domination number of directed de Bruijn graphsand some of its generaliz...
AbstractGiven a Cartesian product G = G1 × … × Gm (m ⩾ 2) of nontrivial connected graphs Gi and the ...
AbstractWe introduce a method of division of vectors to extend the definitions of de Bruijn graphs a...
AbstractIn this paper, we present several relations among the Kronecker product, the line digraph op...
AbstractWe give here a complete description of the spectrum of de Bruijn and Kautz graphs. It is wel...
We study the Kronecker product of generalized de Bruijn digraphs. It is shown that the binary genera...
In this paper, we investigate isomorphic factorizations of the Kronecker product graphs. Using these...
AbstractA new way to expand De Bruijn and Kautz graphs is presented. It consists of deleting superfl...
AbstractIn this paper, we prove the existence of ranking and unranking algorithms on d-ary de Bruijn...
AbstractDe Bruijn and Kautz graphs have been intensively studied as perspective interconnection netw...
AbstractIn this paper we define the De Bruijn digraphs B(D,m) and the Kautz digraphs K(D,m) of a dig...
International audienceMotivated by the work on the domination number of directed de Bruijn graphs an...
In this paper, we investigate isomorphic factorizations of the Kronecker product graphs. Using these...
AbstractThe Good-de Bruijn graph was originally defined to settle a question of existence of a certa...
This master’s thesis in graph theory focuses on graph decomposition. In practice, various forms of g...
Motivated by the work on the domination number of directed de Bruijn graphsand some of its generaliz...
AbstractGiven a Cartesian product G = G1 × … × Gm (m ⩾ 2) of nontrivial connected graphs Gi and the ...
DOI
Add to ORKG