HomeThe Manila Journal of Sciencevol. 4 no. 1 (2001)

On Maximal Biconnected Graphs

Alex C. Gonzaga

Discipline: Mathematics

 

Abstract:

A biconnected graph is a connected graph that contains no complete bipartite spanning subgraph. This paper deals mainly with maximal biconnected graphs. We provide a characterization and some properties of this class of graphs. We determine their dominance and independence numbers. We also prove some properties in G and format.