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.68063MaRDI 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 graph; strong connectedness; finding all the maximal complete subgraphs of a symmetric graph

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C40: Connectivity

05-04: Software, source code, etc. for problems pertaining to combinatorics

Related Items

A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees