Results 201 to 210 of about 16,499 (231)
Some of the next articles are maybe not open access.
Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marisa Gutierrez +3 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marisa Gutierrez +3 more
openaire +2 more sources
Combinatorics, Probability and Computing, 2006
There are several known results asserting that undirected graphs can be partitioned in a way that satisfies various constraints imposed on the degrees. The corresponding results for directed graphs, where degrees are replaced by outdegrees, often fail, and when they do hold, they are usually much harder, and lead to fascinating open problems.
openaire +1 more source
There are several known results asserting that undirected graphs can be partitioned in a way that satisfies various constraints imposed on the degrees. The corresponding results for directed graphs, where degrees are replaced by outdegrees, often fail, and when they do hold, they are usually much harder, and lead to fascinating open problems.
openaire +1 more source
Canadian Journal of Mathematics, 1967
SummaryWe call a digraph “antisymmetrical” if there is an automorphismθof its graph, of period 2, which reverses the direction of every edge and maps no edge or vertex onto itself. We construct a theory of flows invariant underθfor such a diagraph. This theory is analogous to the Max Flow Min Cut theory for ordinary flows in digraphs.
openaire +2 more sources
SummaryWe call a digraph “antisymmetrical” if there is an automorphismθof its graph, of period 2, which reverses the direction of every edge and maps no edge or vertex onto itself. We construct a theory of flows invariant underθfor such a diagraph. This theory is analogous to the Max Flow Min Cut theory for ordinary flows in digraphs.
openaire +2 more sources
Acta Mathematica Scientia, 1988
The paper shows that a digraph is a posetable digraph if and only if by removing any arc (u,v) from the digraph, the resulting digraph contains no directed path between u and v.
openaire +2 more sources
The paper shows that a digraph is a posetable digraph if and only if by removing any arc (u,v) from the digraph, the resulting digraph contains no directed path between u and v.
openaire +2 more sources
Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs
IEEE Transactions on Automatic Control, 2016De-yuan Meng, Mingjun Du, Y. Jia
semanticscholar +1 more source
1993
A conjecture about digraphs is presented. The conjecture has relevance to parallel computing, and is supported by a few concrete results.
openaire +1 more source
A conjecture about digraphs is presented. The conjecture has relevance to parallel computing, and is supported by a few concrete results.
openaire +1 more source
Flocking of the Cucker-Smale Model on General Digraphs
IEEE Transactions on Automatic Control, 2017Jiu‐Gang Dong, L. Qiu
semanticscholar +1 more source
A Distributed Algorithm for Resource Allocation Over Dynamic Digraphs
IEEE Transactions on Signal Processing, 2017Yun Xu +5 more
semanticscholar +1 more source
Homologies of digraphs and Künneth formulas
, 2017A. Grigor’yan +3 more
semanticscholar +1 more source
Extremal Laplacian energy of directed trees, unicyclic digraphs and bicyclic digraphs
Applied Mathematics and Computation, 2020Ligong Wang
exaly