Showing papers on "Connectivity published in 1976"
IBM1
TL;DR: A new concept—a Hierarchy of Complete Problems is defined and several hierarchies in various domains such as graph theory, automata theory, theorem proving and games are established.
Abstract: An attempt is made to present a framework for the diverse complete problems that have been found. A new concept--a Hierarchy of Complete Problems is defined. Several hierarchies in various domains such as graph theory, automata theory, theorem proving and games are established.
41 citations
TL;DR: It is proved that the poset P consisting of all induced connected subgraphs of a nontrivial connected graph G, partially ordered by inclusion, has dimension n where n is the number of noncut vertices in G whether or not P is a lattice.
34 citations
TL;DR: This note characterize eccentric sets, and the minimum order among all graphs whose eccentric set is a given set is found to obtain a new necessary condition for a sequence to be eccentric.
32 citations
20 citations
TL;DR: A unified theory emerges, and facilitates the synthesis and study of multistage switched networks of high connectivity.
Abstract: The multistage graph provides an underlying structure for conventional telephone networks (the number of `stages? in practice being about seven). A systematic analysis in terms of channel graphs and terminal graphs is carried Out using products of graph projections. A unified theory emerges, and facilitates the synthesis and study of multistage switched networks of high connectivity.
4 citations
TL;DR: The relation of similarity on graphs, as given in a previous paper, is redefined here by using the theory of structural numbers as discussed by the authors. But the relation is not defined in this paper.
Abstract: The relation of similarity on graphs, as given in a previous paper, is redefined here by using the theory of structural numbers.
1 citations