Author, Subjects, Keywords

Cited Author

 

 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » By Affiliations
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top 20 Journal Cited
 » Top 20 Cited
 » Top 20 Author Cited
 » Usage Since Sept 2007


 
 
 

Login | Create Account

Coalescence of Difans and Diwheels

Bravo, Diego, and Rada, Juan, (2007) Coalescence of Difans and Diwheels. Bulletin of the Malaysian Mathematical Sciences Society, 30 (1). pp. 49-56. ISSN 0126-6705

Full text not available from this repository.

Official URL: http://math.usm.my/bulletin/pdf/v30n1/v30n1p6.pdf

Affiliations

Universidad de Los Andes, Facultad de Ciencias, Dept. de Matematicas

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.


2000 Mathematics Subject Classification:05C50.

Item Type:Journal
Keywords:Nonderogatory digraphs, coalescence of diagraph.
Subjects:Q Science, Computer Science
ID Code:1365

[1] Gan, C.S. and Koo, V.C. On annihilating uniqueness of directed windmills, Proceedings of the ATCM (ATCM 2002), Melaka, Malaysia.

[2] Rada, J. Nonderogatory directed windmills, submitted.

[3] Lam, K.S. On digraphs with unique annihilating polynomial, PhD Thesis, University of Malaya, Kuala Lumpur, 1990.

[4] Lam, K.S. and Lim, C.K. The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem, Discrete Math. 151(1996), 161-167.

[5] Gan, C.S. The complete product of annihilatingly unique digraphs, Int. J. Math. Math. Sci., (2005), 1327—1331.

[6] D. M. Cvetkovic, M. Doob and H. Sachs, Spectra of graphs., Academic Press, New York, 1980.

Repository Staff Only: item control page