Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs
From MaRDI portal
Publication:1133325
DOI10.1016/0045-7906(79)90002-8zbMath0421.68063MaRDI QIDQ1133325
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
undirected graph; strong connectedness; finding all the maximal complete subgraphs of a symmetric graph
68R10: Graph theory (including graph drawing) in computer science
05C40: Connectivity
05-04: Software, source code, etc. for problems pertaining to combinatorics