STUDIES IN GRAPH THEORY. CONNECTIVITY AND REDUCIBILITY OF GRAPHS

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)

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1961
Accession Number
AD0256227

Entities

People

  • A.l. Dulmage
  • Diane M. Johnson
  • N.s. Mendelsohn

Organizations

  • University of Manitoba

Tags

DTIC Thesaurus Topics

  • Computer Science
  • Graph Theory
  • Mathematics
  • Network Science

Fields of Study

  • Mathematics

Readers

  • Distributed Systems and Data Platform Development
  • Mathematical Modeling and Probability Theory.
  • Technical Research and Report Writing.