Analysis of Graphs by Connectivity Considerations

DOI10.1145/321328.321332zbMath0141.21503OpenAlexW2063248972WikidataQ92972849 ScholiaQ92972849MaRDI QIDQ5516083

C. V. Ramamoorthy

Publication date: 1966

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321328.321332

zbMATH Keywords

topology

Related Items

Complexity and performance of a graph theory algorithm for cluster analysis†, State structures in digital filter configurations. II: Reduced and minimal state structures, A new method to test system diagnosability, Data mining of social networks represented as graphs, Applications of graph theory in computer systems, Enumeration of all minimum feedback edge sets in a directed graph, A graph-structural approach for the generalization of data management systems, A graph model for scheduling processes in systems with parallel computations, Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs, ON THE STRUCTURE OF DIRECTED GRAPHS WITH APPLICATIONS: A Rapprochement with Systems Theory Part I, ON THE STRUCTURE OF DIRECTED GRAPHS WITH APPLICATIONS: A Rapprochement with Systems Theory Part II

Cites Work

• A New Method of Checking the Consistency of Precedence Matrices
• Some Historical and Intuitive Aspects of Graph Theory
• Applications of Graphs and Boolean Matrices to Computer Programming
• A Method of Determining the Number of Vertices Contained in the SC Network Corresponding to a Given SC Transmission Function