A study of singular and nonsingular graphs using reduction formulas

A graph is said to be singular if the determinant of its adjacency matrix is equal to zero. Otherwise, the graph is said to be nonsingular. This thesis studies some classes of graphs in relation to singularity or nonsingularity. Several reduction formulas were used to facilitate the computation of t...

Full description

Saved in:
Bibliographic Details
Main Authors: Alburo, Gertrude Pauline Gerona, Yen, Li-wen
Format: text
Language:English
Published: Animo Repository 1997
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_bachelors/16429
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
Be the first to leave a comment!
You must be logged in first