On digraphs with non-derogatory adjacency matrix.

Deng, C.L.; Gan, C.S.

Displaying similar documents to “On digraphs with non-derogatory adjacency matrix.”

The complete product of annihilatingly unique digraphs.

Gan, C.S. (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Nonderogatory directed windmills.

Rada, Juán (2008)

Revista Colombiana de Matemáticas

Similarity:

The $Q$ -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 $P_{0}$ -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 $1$ - or $2$ -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...

Hall exponents of matrices, tournaments and their line digraphs

Richard A. Brualdi, Kathleen P. Kiernan (2011)

Czechoslovak Mathematical Journal

Similarity:

Let $A$ be a square $(0, 1)$ -matrix. Then $A$ is a Hall matrix provided it has a nonzero permanent. The Hall exponent of $A$ is the smallest positive integer $k$ , if such exists, such that $A^{k}$ is a Hall matrix. The Hall exponent has received considerable attention, and we both review and expand on some of its properties. Viewing $A$ as the adjacency matrix of a digraph, we prove several properties of the Hall exponents of line digraphs with some emphasis on line digraphs of tournament (matrices). ...