Degree sequence for k-arc strongly connected multiple digraphs
Abstract Let D be a digraph on { v 1 , … , v n } $\{v_{1},\ldots, v_{n}\}$ . Then the sequence { ( d + ( v 1 ) , d − ( v 1 ) ) , … , ( d + ( v n ) , d − ( v n ) ) } $\{ (d^{+}(v_{1}), d^{-}(v_{1})), \ldots, (d^{+}(v_{n}), d^{-}(v_{n}))\}$ is called the degree sequence of D. For any given sequence of...
Main Authors: | Yanmei Hong, Qinghai Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2017-10-01
|
Series: | Journal of Inequalities and Applications |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13660-017-1544-3 |
Similar Items
-
Hamiltonian-connected graphs and their strong closures
by: Pak-Ken Wong
Published: (1997-01-01) -
(Strong) Proper Connection in Some Digraphs
by: Yingbin Ma, et al.
Published: (2019-01-01) -
An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences
by: Kai Wang
Published: (2021-03-01) -
Strongly connectable digraphs and non-transitive dice
by: Simon Joyce, et al.
Published: (2020-01-01) -
Arc Fault Tolerance of Cartesian Product of Regular Digraphs on Super-Restricted Arc-Connectivity
by: Zhang Guozhen, et al.
Published: (2019-02-01)