On biconnected graphs

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...

Full description

Saved in:
Bibliographic Details
Main Author: Gonzaga, Alex C.
Format: text
Language:English
Published: Animo Repository 1995
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_masteral/1662
https://animorepository.dlsu.edu.ph/context/etd_masteral/article/8500/viewcontent/TG02389_F_Redacted.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English