A digraph is nonderogatory if its characteristic polynomial and minimal polynomial are equal. We find a characterization of nonderogatory unicyclic digraphs in terms of Hamiltonicity conditions. An immediate consequence of this characterization ia that the complete product of difans and diwheels is nonderogatory
AbstractWe partially resolve a conjecture of Alspach, Bermond, and Sotteau by showing that the lexic...
AbstractA homomorphism of a digraph to another digraph is an edge preserving vertex mapping. A digra...
We show that for each β> 0, every digraph G of sufficiently large order n whose out-degree and in...
Abstract. A directed graph G is nonderogatory if its adjacency matrix A is nonderogatory, i.e., the ...
By assigning a certain direction to the webgraphs, which are defined as the Cartesian product of cyc...
Let G be a digraph with n vertices and let A(G) be its adjacency matrix. A monic polynomial f(x) of ...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
Abstract. Let n be sufficiently large and suppose that G is a digraph on n vertices where every vert...
AbstractWe show that given a digraph X there is a vertex-transitive digraph Y such that the minimal ...
We investigate expressions of form A×C ≅ B×C involving direct products of digraphs. Lovász gave exac...
AbstractWe consider the problem of immersing the complete digraph on t vertices in a simple digraph....
AbstractIn this paper, we consider the paths, cycles and circular colorings of digraphs. Let D be a ...
AbstractWe obtain a sufficient condition for a digraph to be hamiltonian in terms of its connectivit...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
International audienceIn this article, we generalize the concepts of Eulerian and Hamiltonian digrap...
AbstractWe partially resolve a conjecture of Alspach, Bermond, and Sotteau by showing that the lexic...
AbstractA homomorphism of a digraph to another digraph is an edge preserving vertex mapping. A digra...
We show that for each β> 0, every digraph G of sufficiently large order n whose out-degree and in...
Abstract. A directed graph G is nonderogatory if its adjacency matrix A is nonderogatory, i.e., the ...
By assigning a certain direction to the webgraphs, which are defined as the Cartesian product of cyc...
Let G be a digraph with n vertices and let A(G) be its adjacency matrix. A monic polynomial f(x) of ...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
Abstract. Let n be sufficiently large and suppose that G is a digraph on n vertices where every vert...
AbstractWe show that given a digraph X there is a vertex-transitive digraph Y such that the minimal ...
We investigate expressions of form A×C ≅ B×C involving direct products of digraphs. Lovász gave exac...
AbstractWe consider the problem of immersing the complete digraph on t vertices in a simple digraph....
AbstractIn this paper, we consider the paths, cycles and circular colorings of digraphs. Let D be a ...
AbstractWe obtain a sufficient condition for a digraph to be hamiltonian in terms of its connectivit...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
International audienceIn this article, we generalize the concepts of Eulerian and Hamiltonian digrap...
AbstractWe partially resolve a conjecture of Alspach, Bermond, and Sotteau by showing that the lexic...
AbstractA homomorphism of a digraph to another digraph is an edge preserving vertex mapping. A digra...
We show that for each β> 0, every digraph G of sufficiently large order n whose out-degree and in...
DOI
Add to ORKG