Results 201 to 210 of about 6,654 (223)
Some of the next articles are maybe not open access.
On super‐edge‐connected digraphs and bipartite digraphs
Journal of Graph Theory, 1992AbstractA maximally edge‐connected digraph is called super‐λ if every minimum edge disconnecting set is trivial, i.e., it consists of the edges adjacent to or from a given vertex. In this paper sufficient conditions for a digraph to be super‐λ are presented in terms of parameters such as diameter and minimum degree.
openaire +2 more sources
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
Data-knowledge-driven distributed monitoring for large-scale processes based on digraph
Journal of Process Control, 2022Jun Zhao, Chunyue Song, Weiqiang Wu
exaly
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
Failure cause analysis of machine tools using digraph and matrix methods
International Journal of Machine Tools and Manufacture, 2002R Venkata Rao, O P Gandhi
exaly
On the structure of the adjacency matrix of the line digraph of a regular digraph
Discrete Applied Mathematics, 2006Simone Severini
exaly