IJPAM: Volume 81, No. 1 (2012)

ALGEBRAIC CHARACTERIZATION
OF STRONGLY CONNECTED GRAPHS

Zhivko Nedev
International University VNU-HCM
Thu Duc District
HCM City, VIETNAM


Abstract. We introduce the notion of uniform rank. A matrix $\MATRIX{C}$ has an uniform rank $r$ if its (normal) $\rank(C)$ equals $r$ and each of its minors of size $r$ is non-zero.

Received: January 6, 2012

AMS Subject Classification:

Key Words and Phrases:

Download paper from here.


Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2012
Volume: 81
Issue: 1