有向图极大与超级局部边连通性的依赖团数的度序列条件

doi:10.3976/j.issn.1002-4026.2012.04.001

J4 ›› 2012, Vol. 25 ›› Issue (4): 1-5.doi: 10.3976/j.issn.1002-4026.2012.04.001

• Content • Next Articles

Degree sequence conditions of maximally and super-local-edge-connected digraphs depending on a clique number

GAO Jing-Zhen, YANG Hua-Mei

School of Mathematics, Shandong Normal University, Jinan 250014, China

Received:2012-03-17 Online:2012-08-20 Published:2012-08-20

Abstract

CLC Number:

O157.5

GAO Jing-Zhen, YANG Hua-Mei. Degree sequence conditions of maximally and super-local-edge-connected digraphs depending on a clique number[J].J4, 2012, 25(4): 1-5.

[1]	SONG Bo-Yang. Time sequence model based track quality index prediction [J]. J4, 2014, 27(3): 66-72.
[2]	WANG Xiao-Li, WANG Shi-Ying. Lower bounds of the arcconnectivity of a nonmaximally arc-connected digraph [J]. J4, 2014, 27(1): 98-101.
[3]	DONG Sheng-Wei, JIA Yuan-Hua, ZHAO Xue-Jing. Research on improved Ant Colony Algorithm based optimization of container handling sequence problem [J]. J4, 2012, 25(5): 92-97.
[4]	LUO Jin-Mei, ZUO Lian-Cui. L(2,1)-labeling of the complement graphs of a class of 2-sparse graphs [J]. J4, 2012, 25(1): 9-12.
[5]	SONG Guang-Ai. Linear Recursive Sequences and Polynomial Ring [J]. J4, 2011, 24(2): 6-7.

Degree sequence conditions of maximally and super-local-edge-connected digraphs depending on a clique number

PDF (PC)

Like

Knowledge

Cited

Abstract

Cite this article

share this article

References

Related Articles 5

Metrics

Comments

Recommended 0