A study of singular and nonsingular graphs using reduction formulas

Date of Publication

1997

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

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 the determinants of adjacency matrices of graphs. Application of the reduction formulas to the computation of determinant of symmetric (0,1)-matrices with zero diagonal is discussed and illustrated. Most of the formulas stated in the theorems in this thesis are results given by Severino Gervacio in his article entitled A Study of Singular Bipartite Graphs and H.M. Rara in her dissertation entitled Singular Graphs. The researchers provided some new results based from the reduction formulas studied.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU08289

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

Physical Description

83 leaves

Keywords

Graph theory; Algebras, Linear; Mathematics--Formulae

This document is currently not available here.

Share

COinS