Results 191 to 200 of about 6,654 (223)
Line Digraph Iterations and the (d, k) Digraph Problem [PDF]
IEEE Transactions on Computers, 1984 This paper studies the behavior of the diameter and the average distance between vertices of the line digraph of a given digraph. The results obtained are then applied to the so-called (d, k) digraph problem, that is, to maximize the number of ...
Fiol Mora, Miquel Àngel +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mathematical Notes, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grigoryan, Alexander +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grigoryan, Alexander +2 more
openaire +1 more source
Journal of Graph Theory, 2014
AbstractThe clique number of a digraph D is the size of the largest bidirectionally complete subdigraph of D. D is perfect if, for any induced subdigraph H of D, the dichromatic number defined by Neumann‐Lara (The dichromatic number of a digraph, J. Combin. Theory Ser. B 33 (1982), 265–270) equals the clique number .
Stephan Dominique Andres +1 more
openaire +2 more sources
AbstractThe clique number of a digraph D is the size of the largest bidirectionally complete subdigraph of D. D is perfect if, for any induced subdigraph H of D, the dichromatic number defined by Neumann‐Lara (The dichromatic number of a digraph, J. Combin. Theory Ser. B 33 (1982), 265–270) equals the clique number .
Stephan Dominique Andres +1 more
openaire +2 more sources
Estimation of digraph costs for keyboard layout optimization [PDF]
International Journal of Industrial Ergonomics, 2015 The main aim of this study was to estimate the digraph costs (interkey-stroke times) based on the digraph (two consecutive keys) tapping rates for the optimization of keyboard layouts considering the touch typing principles.
Ali Iseri, Mahmut Ekşioğlu
exaly +2 more sources
Regular Digraphs Containing a Given Digraph
Canadian Mathematical Bulletin, 1984AbstractLet the maximum degree d of a digraph D be the maximum of the set of all outdegrees and indegrees of the points of D. We prove that every digraph D of order P and maximum degree d has a d-regular superdigraph H with at most d + 1 more points, and that this bound, which is independent of p, is best possible.
Harary, Frank, Karabed, Razmik
openaire +1 more source
CKI-Digraphs, Generalized Sums and Partitions of Digraphs
Graphs and Combinatorics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hortensia Galeana-Sánchez, Mika Olsen
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 2010
One of the classical results in packing theory states that every graph of order $n$ and size less than or equal to $n-2$ is packable in its complement. Moreover, the bound is sharp because the star is not packable. A similar problem arises for digraphs, namely, to find the maximal number $f_D(n)$ such that every digraph of order $n$ and size less than ...
Agnieszka Görlich, Andrzej Zak
openaire +1 more source
One of the classical results in packing theory states that every graph of order $n$ and size less than or equal to $n-2$ is packable in its complement. Moreover, the bound is sharp because the star is not packable. A similar problem arises for digraphs, namely, to find the maximal number $f_D(n)$ such that every digraph of order $n$ and size less than ...
Agnieszka Görlich, Andrzej Zak
openaire +1 more source
Canadian Mathematical Bulletin, 1966
The line - graph of an ordinary graph G is that graph whose points can be put in one-to-one correspondence with the lines of G in such a way that two points of are adjacent if and only if the corresponding lines of G are adjacent. This concept originated with Whitney [ 5 ], has the property that its (point) chromatic number equals the line chromatic
Chartrand, G., Stewart, M. J.
openaire +1 more source
The line - graph of an ordinary graph G is that graph whose points can be put in one-to-one correspondence with the lines of G in such a way that two points of are adjacent if and only if the corresponding lines of G are adjacent. This concept originated with Whitney [ 5 ], has the property that its (point) chromatic number equals the line chromatic
Chartrand, G., Stewart, M. J.
openaire +1 more source
Journal of Graph Theory, 1980
AbstractA hypotraceable digraph is a digraph D = (V, E) which is not traceable, i.e., does not contain a (directed)Hamiltonian path, but for which D ‐ v is traceable for all ve ∈ V. We prove that a hypotraceable digraph of order n exists iff n ≥ 7 and that for each k ≥ 3 there are infinitely many hypotraceable oriented graphs with a source and a sink ...
Martin Grötschel +2 more
openaire +2 more sources
AbstractA hypotraceable digraph is a digraph D = (V, E) which is not traceable, i.e., does not contain a (directed)Hamiltonian path, but for which D ‐ v is traceable for all ve ∈ V. We prove that a hypotraceable digraph of order n exists iff n ≥ 7 and that for each k ≥ 3 there are infinitely many hypotraceable oriented graphs with a source and a sink ...
Martin Grötschel +2 more
openaire +2 more sources