Title of article :
Coalescence of Difans and Diwheels
Author/Authors :
Bravo, Diego Universidad de Los Andes - Facultad de Ciencias - Departamento de Matematicas, Venezuela , Rada, Juan Universidad de Los Andes - Facultad de Ciencias - Departamento de Matematicas, Venezuela
Abstract :
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.
Keywords :
Nonderogatory digraphs , coalescence of diagraph.
Journal title :
Bulletin of the Malaysian Mathematical Sciences Society
Journal title :
Bulletin of the Malaysian Mathematical Sciences Society
