数学与计算机科学 |
|
|
|
|
超连通图的充分条件 |
郭利涛 |
厦门理工学院 应用数学学院, 福建 厦门 361024 |
|
Sufficient conditions for graphs to be super connected |
GUO Litao |
School of Applied Mathematics, Xiamen University of Technology, Xiamen 361024, Fujian Province, China |
[1] |
BONDY J,MURTY U.Graph Theory and Its Application[M]. New York:Academic Press, 1976.
|
[2] |
KELMANS A. Asymptotic formulas for the probability of k-connectedness of random graphs[J].Theory of Probability and Its Applications,1972,17(2):253-265.
|
[3] |
LESNIAK L. Results on the edge-connectivity of graphs[J].Discrete Mathematics, 1974,8(4):351-354.
|
[4] |
FIOL M. On super-edge-connected digraphs and bipartite digraphs[J].Journal of Graph Theory, 1992,16(6):545-555.
|
[5] |
TIAN Y Z, GUO L T, MENG J X, et al. Inverse degree and super edge-connectivity[J].International Journal of Computer Mathematics, 2012,89(6):752-759.
|
[6] |
FAJTLOWICZ S. On conjectures of graffiti Ⅱ[J].Congr Numer, 1987,60:189-197.
|
[7] |
DANKELMANNP, SWART H, BERG P V D. Diameter and inverse degree[J].Discrete Mathematics,2008,308(5):670-673.
|
[8] |
DANKELMANNP, HELLWIG A, VOLKMANN L. Inverse degree and edge-connectivity[J].Discrete Mathematics, 2009,309(9):2943-2947.
|
[9] |
ERDÖS P, PACH J, SPENCER J. On the mean distance between points of a graph[C]//Proceedings of the 250th Anniversary Conference on Graph Theory,Congressus Numerantium 64. Winnipeg:Utilitas Mathematica Publishing Inc,1988:121-124.
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|