On singular and nonsingular digraphs
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency matrix. If this adjacency matrix is singular, then D is singular, otherwise D is nonsingular. This study investigates the singularity and nonsingularity of digraphs and in particular of some classes of...
Saved in:
Main Author: | Jos, Isagani B. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2000
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_doctoral/848 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
On the skew energy of a digraph
by: Carpio, Ariana Isabel G., et al.
Published: (2016) -
A study of singular and nonsingular graphs using reduction formulas
by: Alburo, Gertrude Pauline Gerona, et al.
Published: (1997) -
On generalized fibonacci cubes which contain Hamiltonian paths
by: Mustard, Elaine M.
Published: (1998) -
On Wieferich primes and period lengths for the expansions of fractions
by: Vincent, Jake T. Ngo, et al.
Published: (2009) -
Aljabar Bersih
by: Wijayanti, Indah Emilia
Published: (2012)