Premium
Sufficient conditions for equality of connectivity and minimum degree of a graph
Author(s) -
Topp Jerzy,
Volkmann Lutz
Publication year - 1993
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190170606
Subject(s) - combinatorics , mathematics , graph , degree (music) , discrete mathematics , physics , acoustics
For a graph G , let n ( G ), κ( G ) and δ( G ) denote the order, the connectivity, and the minimum degree of G , respectively. The paper contains some conditions on G implying κ( G ) = δ( G ). One of the conditions is that n ( G ) ≤ δ( G )(2 p −1)/(2 p −3) if G is a p ‐partite graph. © 1993 John Wiley & Sons, Inc.