The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem

DOI10.1016/0012-365X(94)00093-XzbMath0853.05055MaRDI QIDQ1916390

Chong-Keang Lim, Kah Seng Lam

Publication date: 3 July 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphcharacteristic polynomialadjacency matrixannihilating polynomialmonic polynomialladder digraph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Nonderogatory directed webgraph ⋮ Nonderogatory unicyclic digraphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem