Date of Publication
4-12-1995
Document Type
Master's Thesis
Degree Name
Master of Science in Mathematics
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Severino Gervacio
Defense Panel Chair
Yolando Beronque
Defense Panel Member
Leonor Ruivivar
Rigor B. Ponsones
Abstract/Summary
A graph G is said to be biconnected if G and its complement G prime are connected.This study, presents and proves necessary and sufficient conditions for biconnectedness of graphs, in general, and trees, in particular. It also introduces and investigates properties of a new class of graphs known as the maximal biconnected graphs. Furthermore, the study states and proves a theorem on the greatest lower bound and least upper bound of independence, dominance, chromatic and connectivity numbers of biconnected graphs of order n equal to or greater than 4. A simple formula that also specifies characteristic number - nullity - is applied in proving theorems concerning biconnected graphs G such that both G and G prime satisfy specified properties. Also, it states and proves properties of some graph operations on biconnected graphs such as graphing, sum, cartesian product and conjunction. Finally, a theorem on the diameter of biconnected graph is stated and proved.
Abstract Format
html
Language
English
Format
Accession Number
TG02389
Shelf Location
Archives, The Learning Commons, 12F Henry Sy Sr. Hall
Physical Description
73 leaves
Keywords
Graph theory; Trees (Graph theory)
Upload Full Text
wf_yes
Recommended Citation
Gonzaga, A. C. (1995). On biconnected graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_masteral/1662
