Show simple item record

dc.contributor.authorPootheri, Sridar Kuttan
dc.description.abstractApplying the Tutte decomposition of 2-connected graphs into 3-block trees we provide unique structural characterizations of several classes of 2-connected graphs, including minimally 2-connected graphs, minimally 2-edge-connected graphs, critically 2-connected graphs, critically 2-edge-connected graphs, 3-edge-connected graphs, 2-connected cubic graphs and 3-connected cubic graphs. We also give a characterization of minimally 3-connected graphs.|Cycle index sum equations for counting unlabeled minimally 2-connected graphs, unlabeled 2-connected minimally 2-edge-connected graphs and unlabeled 2-connected 3-edge-connected graphs are derived from the structural relations. Polynominal space counting algorithms are then developed using cycle index sum inversion techniques. The appendices contain tables of the numbers of edges, obtained by computer implementation of the algorithmys. These are listed for node orders up to 32, 25 and 34 respectively.
dc.subjectInversion of cycle index sum relations
dc.subjectunique structural characterizations
dc.subjectunlabeled graph counting
dc.subjectgraph conunting algorithm
dc.subjectminimally 2-connected graphs
dc.subjectminimally 2-edge-connected graphs
dc.subject3-edge-connected graphs
dc.subjectdecomposition characterizations
dc.subjectcritically 2-connected graphs
dc.subjectcritically 2-edge-connected graphs
dc.subject2-connected cubic graphs
dc.subject3-connected cubic graphs
dc.subjectminimally 3-connected graphs
dc.titleCharacterizing and counting classes of unlabeled 2-connected graphs
dc.description.advisorRobert W. Robinson
dc.description.committeeRobert W. Robinson
dc.description.committeeBrian D. Boe
dc.description.committeeE. Rodney Canfield
dc.description.committeeAndrew G. Granville
dc.description.committeeRobert Varley

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record