Accession Number:

AD0256227

Title:

STUDIES IN GRAPH THEORY. CONNECTIVITY AND REDUCIBILITY OF GRAPHS

Descriptive Note:

Corporate Author:

MANITOBA UNIV WINNIPEG

Report Date:

1961-12-01

Pagination or Media Count:

1.0

Abstract:

Corresponding to every graph, bipartite graph or directed bipartite graph there exists a directed graph which is connected if and only if the original graph is connected. It is shown that for every directed graph there exists a certain bipartite graph such that the directed graph is connected if and only if the bipartite graph is irreducible. Other connections between reducibility and connectivity are established. Author

Subject Categories:

Distribution Statement:

APPROVED FOR PUBLIC RELEASE