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...
Saved in:
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 |
Similar Items
-
The dimension of the join of two graphs
by: Gervacio, Severino V., et al.
Published: (2005) -
On graceful graphs
by: Paculba, Marianne S., et al.
Published: (1998) -
An exposition on Eulerian irregularity in graphs
by: Cheng, Janelle C., et al.
Published: (2015) -
On applications of the retracing method for distance-regular graphs
by: Vencer, Norma Luz C.
Published: (2006) -
On a note on Hamilton graphs
by: Balisi, Richard Angelo, et al.
Published: (2008)