The complete product of annihilatingly unique digraphs.
Gan, C.S. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “On digraphs with non-derogatory adjacency matrix.”
The complete product of annihilatingly unique digraphs.
Nonderogatory directed windmills.
Rada, Juán (2008)
Revista Colombiana de Matemáticas
Similarity:
The -matrix completion problem.
Dealba, Luz Maria, Hogben, Leslie, Sarma, Bhaba Kumar (2009)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
On Bratton's conjecture and a theorem of Luce
Bhargava, T.N., O'Korn, L.J. (1967)
Portugaliae mathematica
Similarity:
The nonnegative -matrix completion problem.
Choi, Ji Young, Dealba, Luz Maria, Hogben, Leslie, Kivunge, Benard M., Nordstrom, Sandra K., Shedenhelm, Mike (2003)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
New proofs of the uniqueness of extremal noneven digraphs.
Lim, Chjan C., Van Patten, Gregory K. (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Some remarks about digraphs with nonisomorphic - or -neighbourhoods
Halina Bielak, Elżbieta Soczewińska (1983)
Časopis pro pěstování matematiky
Similarity:
A remark on almost Moore digraphs of degree three.
Baskoro, E.T., Miller, M., Širáň, J. (1997)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
k-Kernels and some operations in digraphs
Hortensia Galeana-Sanchez, Laura Pastrana (2009)
Discussiones Mathematicae Graph Theory
Similarity:
Let D be a digraph. V(D) denotes the set of vertices of D; a set N ⊆ V(D) is said to be a k-kernel of D if it satisfies the following two conditions: for every pair of different vertices u,v ∈ N it holds that every directed path between them has length at least k and for every vertex x ∈ V(D)-N there is a vertex y ∈ N such that there is an xy-directed path of length at most k-1. In this paper, we consider some operations on digraphs and prove the existence of k-kernels in digraphs formed...