Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs

DOI10.1016/0045-7906(79)90002-8zbMath0421.68063OpenAlexW2163601061MaRDI QIDQ1133325

S. H. Smith

Publication date: 1979

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7906(79)90002-8

zbMATH Keywords

undirected graphstrong connectednessfinding all the maximal complete subgraphs of a symmetric graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (3)

An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720 ⋮ Complexity and performance of a graph theory algorithm for cluster analysis† ⋮ A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees

This page was built for publication: Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs