Journal of East China Normal University(Natural Science) >

2017 , Vol. 2017 >Issue 1: 19 - 25

DOI: https://doi.org/10.3969/j.issn.1000-5641.2017.01.003

Probing equivalent definitions of 2-edge connected graphs

  • SU Jing ,
  • MA Fei ,
  • YAO Bing
Expand
  • College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China

Received date: 2015-12-29

  Online published: 2017-01-13

Fold

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.

Key words： 2-edge connected graph; ear edge decomposition; block; trail; cycle

Cite this article

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

References

[ 1 ] CRUCITTI P, LATORA V, MARCHIORI M, et al. Error and attack tolerance of complex networks [J]. Physica A, 2004, 340: 388-394.
[ 2 ] KRAPIVSKY P L, REDNER S, LEYVRAZ F. Connectivity of growing random networks [J]. Phys Rev Lett,2000, 85(21): 4629-4632.
[ 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, ZHANGWJ, 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.

Options
Outlines

/

〈 〉