论文信息 - The strongest monotone degree condition for n-connectedness of a graph

The strongest monotone degree condition for n-connectedness of a graph

Abstract It is shown that Bondy's degree condition for n -connectedness of a graph is the strongest monotone degree condition for forcibly n -connected graphic sequences.

F. T Boesch

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] S. L. Hakimi. On the Existence of Graphs with Prescribed Degrees and Connectivity , 1974 .

[3] V. Chvátal. On Hamilton's ideals , 1972 .

[4] Siddani Bhaskara Rao,et al. EXISTENCE OF TRICONNECTED GRAPHS WITH PRESCRIBED DEGREES , 1970 .

[5] D. L. Wang,et al. On the existence of N-connected graphs with prescribed degrees (n ≧ 2) , 1973, Networks.

[6] Gary Chartrand,et al. A sufficient condition for n -connectedness of graphs , 1968 .