Title of article
Bounds on the size of graphs of given order and
Author/Authors
D.P. Day، نويسنده , , Ortrud R. Oellermann، نويسنده , , Henda C. Swart، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
7
From page
217
To page
223
Abstract
The l-connectivity ϰ/(G) of a graph G of order p ⩾ l − 1 is the minimum number of vertices that are required to be deleted from G to produce a graph with at least l components or with fewer than l vertices. Extremal graphs are investigated and bounds established on the number of edges in graphs of given order and l-connectivity.
Keywords
Generalized connectivity , View the MathML source-connectivity
Journal title
Discrete Mathematics
Serial Year
1999
Journal title
Discrete Mathematics
Record number
950710
Link To Document