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...
Prif Awduron: | Yanmei Hong, Qinghai Liu |
---|---|
Fformat: | Erthygl |
Iaith: | English |
Cyhoeddwyd: |
SpringerOpen
2017-10-01
|
Cyfres: | Journal of Inequalities and Applications |
Pynciau: | |
Mynediad Ar-lein: | http://link.springer.com/article/10.1186/s13660-017-1544-3 |
Eitemau Tebyg
-
Minimally Strong Subgraph (k,ℓ)-Arc-Connected Digraphs
gan: Sun Yuefang, et al.
Cyhoeddwyd: (2022-08-01) -
Hamiltonian-connected graphs and their strong closures
gan: Pak-Ken Wong
Cyhoeddwyd: (1997-01-01) -
(Strong) Proper Connection in Some Digraphs
gan: Yingbin Ma, et al.
Cyhoeddwyd: (2019-01-01) -
An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences
gan: Kai Wang
Cyhoeddwyd: (2021-03-01) -
Strongly connectable digraphs and non-transitive dice
gan: Simon Joyce, et al.
Cyhoeddwyd: (2020-01-01)