Oktay Cesur

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Let G be a digraph with vertices labelled {1, 2, . . . , n} and its adjacency matrix A(G) the n × n matrix whose ijth entry is the number of arcs joining vertex i to vertex j. A digraph is nonderogatory if the characteristic polynomial and minimal polynomial of its adjacency matrix are equal. Computation of the minimal polynomial of a matrix is harder than(More)
  • 1