The maximum size of graphs satisfying a degree condition
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\)''.
scientific article; zbMATH DE number 89872