Premium
Degree sequence conditions for maximally edge‐connected graphs and digraphs
Author(s) -
Dankelmann Peter,
Volkmann Lutz
Publication year - 1997
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/(sici)1097-0118(199709)26:1<27::aid-jgt4>3.0.co;2-j
Subject(s) - combinatorics , mathematics , bipartite graph , degree (music) , discrete mathematics , sequence (biology) , graph , line graph , simple (philosophy) , physics , acoustics , genetics , philosophy , epistemology , biology
In this paper we give simple degree sequence conditions for the equality of edge‐connectivity and minimum degree of a (di‐)graph. One of the conditions implies results by Bollobás, Goldsmith and White, and Xu. Moreover, we give analogue conditions for bipartite (di‐)graphs. © 1997 John Wiley & Sons, Inc. J Graph Theory 26:27–34, 1997