Characterizing and counting classes of unlabeled 2-connected graphs
Pootheri, Sridar Kuttan
MetadataShow full item record
Applying 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.
Showing items related by title, author, creator and subject.
Pootheri, Sridar Kuttan (uga, 2000-05)Applying the Tutte decomposition of 2-connected graphys into 3-block trees, unique structural characterizations of several classes of 2-connected graphs were provided in the PhD dissertation of the author under the title ...
Chen, Zhangyun (uga, 2001-08)A graph G = (V, E) is 3-edge-connected if and only if the subgraph (V, E - S) is connected for every set S of at most 2 edges. Two versions of an algorithm to test an arbitrary graph for 3-edge-connectivity due to Nagamochi ...
Sun, Feng (uga, 2003-05)A new algorithm to test an arbitrary graph for 3-edge-connectivity is proposed, implemented and tested. It is a modi¯cation of the classic linear algorithm of Hopcroft and Tarjan for dividing a graph into 3-connected ...