论文信息 - Lower-bounds on the connectivities of a graph

Lower-bounds on the connectivities of a graph

This article presents a study of the connectivities of a graph as a function of other graph parameters such as the number of vertices, the maximum degree, and the diameter. As a result, lower-bounds on the connectivities of a graph as a function of these parameters are computed. These bounds could serve as sufficient conditions for a graph to be h-edge-connected or k-connected. Consequently, the connectivity characteristics of many of the densest known graphs are determined.

Abdol-Hossein Esfahanian | Abdol-Hossein Esfahanian | A. Esfahanian

[1] G. Chartrand. A Graph-Theoretic Approach to a Communications Problem , 1966 .

[2] Linda .LESNIAK. Results on the edge-connectivity of graphs , 1974, Discret. Math..

[3] Donald L. Goldsmith,et al. On graphs with equal edge-connectivity and minimum degree , 1978, Discret. Math..

[4] B. Bollobás,et al. Extremal Graph Theory , 2013 .

[5] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[6] Roger C. Entringer,et al. A sufficient condition for equality of edge-connectivity and minimum degree of a graph , 1979, J. Graph Theory.

[7] Karl W. Doty,et al. New Designs for Dense Processor Interconnection Networks , 1984, IEEE Transactions on Computers.

[8] S. Louis Hakimi,et al. On computing the connectivities of graphs and digraphs , 1984, Networks.

[9] Makoto Imase,et al. Connectivity of Regular Directed Graphs with Small Diameters , 1985, IEEE Transactions on Computers.