Probing equivalent definitions of 2-edge connected graphs

SU Jing; MA Fei; YAO Bing

doi:10.3969/j.issn.1000-5641.2017.01.003

Issue 1

Jan. 2017

Turn off MathJax

Article Contents

Article Navigation > Journal of East China Normal University (Natural Sciences) > 2017 > (1): 19-25

SU Jing, MA Fei, YAO Bing. Probing equivalent definitions of 2-edge connected graphs[J]. Journal of East China Normal University (Natural Sciences), 2017, (1): 19-25. doi: 10.3969/j.issn.1000-5641.2017.01.003

Citation:

SU Jing, MA Fei, YAO Bing. Probing equivalent definitions of 2-edge connected graphs[J]. Journal of East China Normal University (Natural Sciences), 2017, (1): 19-25. doi: 10.3969/j.issn.1000-5641.2017.01.003

Citation:

PDF( 339 KB)

Probing equivalent definitions of 2-edge connected graphs

doi: 10.3969/j.issn.1000-5641.2017.01.003

College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China

Received Date: 2015-12-28
Publish Date: 2017-01-25

Abstract

Abstract

As known, k-edge connected graphs play an important role in the research of networks and graph theory. There are many propositions of 2-edge connected graphs nowadays, which depict the essences of 2-edge connected graphs. We present 17 equivalent propositions of 2-edge connected graphs and dig more properties of 2-edge connected graphs from different aspects of 2-edge connected graphs. Furthermore, two equivalent propositions of 2-edge connected graphs by two new operations are proposed, and then we provide the equivalent proofs between the propositions we have collected and discovered.
- 2-edge connected graph,
- ear edge decomposition,
- block,
- trail,
- cycle

FullText(HTML)

References(9)

References

[1]	CRUCITTI P, LATORA V, MARCHIORI M, et al. Error and attack tolerance of complex networks [J]. Physica A, 2004, 340: 388-394. doi: 10.1016/j.physa.2004.04.031
[2]	KRAPIVSKY P L, REDNER S, LEYVRAZ F. Connectivity of growing random networks [J]. Phys Rev Lett, 2000, 85(21): 4629-4632. doi: 10.1103/PhysRevLett.85.4629
[3]	YAO B, YANG C, YAO M, et al. Graphs as models of scale-free networks [J]. Applied Mechanics and Materials, 2013, 380-384: 2034-2037.
[4]	YAO B, WANG H Y, YAO M, et al. On the collapse of graphs related to scale-free networks [C]//Proceeding of the 3rd International Conference on Information Science and Technology. 2013: 738-743.
[5]	YAO B, LIU X, ZHANG W J, et al. Applying graph theory to the internet of things [C]//2013 IEEE International Conference on High Performance Computing and Communications and 2013 IEEE International Conference on Embedded and Ubiquitous Computing. 2013: 2354-2361.
[6]	WEST D B. 图论导论 [M]. 李建中, 骆吉洲, 译. 原书第2版. 北京:机械工业出版社, 2006.
[7]	BONDY J A, MURTY U S R. Graph Theory with Applications [M]. New York: The Macmillan Publishers, 1976.
[8]	高随祥. 图论与网络流理论[M]. 北京: 高等教育出版社, 2009.
[9]	DIESTEL R. Graph Theory [M]. 于春林, 王涛, 王光辉, 译. 第4版. 北京:高等教育出版社, 2012.