Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number

Journal of Graph Theory

Volumn 42, Issue 3, 2003, Pages 234-245

  Volkmann, Lutz ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Clique number; Degree sequence; Edge connectivity

Indexed keywords

EID: 0037341704     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.10087     Document Type: Article

References (13)

1. 1 B. Bollobás, On graphs with equal edge‐connectivity and minimum degree, Discrete Math 28 (1979), 321–323.
2. 2 G. Chartrand, A graph theoretic approach to a communications problem, SIAM J Appl Math 14 (1966), 778–781.
3. 3 G. Chartrand and L. Lesniak, Graphs and Digraphs, 3rd Edition, Wadsworth, Belmont, CA, 1996.
4. 4 P. Dankelmann and L. Volkmann, New sufficient conditions for equality of minimum degree and edge‐connectivity, Ars Combin 40 (1995), 270–278.
5. 5 P. Dankelmann and L. Volkmann, Degree sequence conditions for maximally edge‐connected graphs and digraphs, J Graph Theory 26 (1997), 27–34.
6. 6 P. Dankelmann and L. Volkmann, Degree sequence conditions for maximally edge‐connected graphs depending on the clique number, Discrete Math 211 (2000), 217–223.
7. 7 L. Lesniak, Results on the edge‐connectivity of graphs, Discrete Math 8 (1974), 351–354.
8. 8 J. Plesník, Critical graphs of given diameter, Acta Fac Rerum Natur Univ Commenian Math 30 (1975), 71–93.
9. 9 J. Plesník and S. Znám, On equality of edge‐connectivity and minimum degree of a graph, Arch Math (Brno) 25 (1989), 19–25.
10. 10 P. Turán, An extremal problem in graph theory, Mat‐Fiz Lapok 48 (1941), 436–452 (in Hungarian).
11. 11 L. Volkmann, Remarks on the p ‐fold edge connectivity of graphs. An Univ Buccuresti Mat 37 (1988), 75–79 (in German).
12. 12 L. Volkmann, Edge‐connectivity in p ‐partite graphs, J Graph Theory 13 (1989), 1–6.
13. 13 L. Volkmann, Foundations of graph theory, Springer‐Verlag, Wien New York (1996) (in German).