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   

  1. School of Mathematics, Shandong Normal University, Jinan 250014, China
  • Received:2012-03-17 Published:2012-08-20 Online:2012-08-20

Abstract:

        We present the degree sequence conditions of maximally and super-local-edge-connected digraphs  depending  on a clique number with the theorem of Turán. Different cases show that these conditions are the most  possible.

Key words: maximally local-edge-connected digraph, super-local-edge-connected digraph, clique number, degree , sequence

CLC Number: 

  • O157.5

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0), which permits third parties to freely share (i.e., copy and redistribute the material in any medium or format) and adapt (i.e., remix, transform, or build upon the material) the articles published in this journal, provided that appropriate credit is given, a link to the license is provided, and any changes made are indicated. The material may not be used for commercial purposes. For details of the CC BY-NC 4.0 license, please visit: https://creativecommons.org/licenses/by-nc/4.0