The maximum size of graphs satisfying a degree condition
type: Item
instance of: scholarly article
title: The maximum size of graphs satisfying a degree condition
zbMATH Open document ID: 0756.05076
DOI: 10.1016/0012-365X(92)90335-D
author: Yiping Qiu
author: Xiao Feng Jia
published in: Discrete Mathematics
publication date: 1993-01-16T00:00:00Z
review text: The note enlarges the simple graphs family satisfying Krol and Veldman's inequality connected with upper bound of size of graphs. It is achieved by lemma and theorem proof, eliminating requirement (i): (i) all studied graphs are critically \(h\)-connected, and by transforming equality (ii): (ii) every vertex of graph \(G\) is adjacent to a vertex with degree \(h\) into inequality: every vertex of \(G\) is adjacent to a vertex with degree not more then ``\(h\)''.
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 89872
zbMATH Keywords: maximum size
zbMATH Keywords: degree condition
zbMATH Keywords: order
zbMATH Keywords: size of graph
zbMATH Keywords: connectivity
zbMATH Keywords: bound
reviewed by: Vitali Oscarovich Groppen
MaRDI profile type: Publication
cites work: On maximum critically h-connected graphs
full work available at URL: 0012-365x(92)90335-d
OpenAlex ID: W2054033546
description: scientific article; zbMATH DE number 89872