Results 201 to 210 of about 8,697 (224)
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
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 +2 more sources
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 +2 more sources
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
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
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
Digraph and matrix methods for the machinability evaluation of work materials
International Journal of Machine Tools and Manufacture, 2002R Venkata Rao, O P Gandhi
exaly
Selection, identification and comparison of industrial robots using digraph and matrix methods
Robotics and Computer-Integrated Manufacturing, 2006R Venkata Rao
exaly
Sufficient Conditions for a Digraph to be Supereulerian
Journal of Graph Theory, 2015Jørgen Bang-Jensen +1 more
exaly
On the structure of the adjacency matrix of the line digraph of a regular digraph
Discrete Applied Mathematics, 2006Simone Severini
exaly