#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2007

2017

- This year (1)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Diego O. Bravo, Juan Rada
- Int. J. Math. Mathematical Sciences
- 2007

- Diego Bravo, Juan Rada
- 2007

A directed graph G is nonderogatory if its adjacency matrix A is nonderogatory, i.e., the characteristic polynomial of A is equal to the minimal polynomial of A. We analyze the problem whether the coalescence of difans and diwheels is nonderogatory. Also, a formula for the characteristic polynomial of the coalescence of two directed graphs is presented.… (More)

- Diego O. Bravo, Florencia Cubría, Juan Rada
- Applied Mathematics and Computation
- 2017

A digraph is nonderogatory if its characteristic polynomial and minimal polynomial are equal. Relations between nonderogatory digraphs and their automorphism groups have appeared in the literature (see [1] and [2, Theorem 5.10]). More recently, several articles (see, e.g., [1, 3–8]) address the problem of determining when certain operations between… (More)

- ‹
- 1
- ›