Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs
type: Item
instance of: scholarly article
title: Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs
zbMATH Open document ID: 0421.68063
DOI: 10.1016/0045-7906(79)90002-8
author: S. H. Smith
published in: Computers and Electrical Engineering
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05-04
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 3655369
zbMATH Keywords: finding all the maximal complete subgraphs of a symmetric graph
zbMATH Keywords: strong connectedness
zbMATH Keywords: undirected graph
MaRDI profile type: Publication
full work available at URL: 0045-7906(79)90002-8
OpenAlex ID: W2163601061
description: scientific article; zbMATH DE number 3655369