Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs (Q1133325)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs |
scientific article; zbMATH DE number 3655369
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs |
scientific article; zbMATH DE number 3655369 |
Statements
Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs (English)
0 references
1979
0 references
finding all the maximal complete subgraphs of a symmetric graph
0 references
strong connectedness
0 references
undirected graph
0 references
