id: 05501202
dt: j
an: 05501202
au: Bravo, Diego; Rada, Juan
ti: Non-derogatory digraphs. (Digrafos no-derogatorios.)
so: Notas Mat. 3, No. 1, 13-31 (2007).
py: 2007
pu: Departamento de Matemática, Facultad de Ciencias, Universidad de los
    Andes, Mérida
la: ES
cc: 
ut: 
ci: 
li: 
ab: Summary: A digraph $D$ is said to be non-derogatory if its adjacency matrix
    is non-derogatory., i.e., the characteristic polynomial of $A$ is equal
    to the minimal polynomila of $A$. We analyse the problem when the
    coalescence of directed fans and directed cycles is non-derogatory. An
    expression for the characteristic polynomial of the coalescence of two
    digraphs is presented. We find a characterization of unicyclic
    non-derogatory digraphs in terms of hamiltonicity conditions.
rv: