Results 201 to 210 of about 8,914 (221)
Some of the next articles are maybe not open access.
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
Extremal Laplacian energy of directed trees, unicyclic digraphs and bicyclic digraphs
Applied Mathematics and Computation, 2020Ligong Wang
exaly
On the structure of strong 3-quasi-transitive digraphs
Discrete Mathematics, 2010Ilan Goldfeder +1 more
exaly
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
Information Processing Letters, 2003Yukio Shibata
exaly
Distributed Strategies for Generating Weight-Balanced and Doubly Stochastic Digraphs
European Journal of Control, 2012Jorge Cortes, Bahman Gharesifard
exaly
Independent spanning trees with small depths in iterated line digraphs
Discrete Applied Mathematics, 2001Toru Hasunuma, Hiroshi Nagamochi
exaly
Extremal iota energy of bicyclic digraphs
Applied Mathematics and Computation, 2017Rashid Farooq +2 more
exaly
On diregular digraphs with degree two and excess two
Discrete Applied Mathematics, 2018James Tuite
exaly