scholarly journals Algebraic Algorithms for Even Circuits in Graphs

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 859
Author(s):  
Huy Tài Hà ◽  
Susan Morey
Keyword(s):  
Algebraic Algorithms ◽  
Directed Cycles

We present an algebraic algorithm to detect the existence of and to list all indecomposable even circuits in a given graph. We also discuss an application of our work to the study of directed cycles in digraphs.

Algebraic algorithms for the reliability analysis of multi-state k -out-of- n systems

2019 ◽  
Vol 53 (3) ◽  
pp. 146-149
Author(s):  
Patricia Pascual-Ortigosa ◽  
Eduardo Sáenz-de-Cabezón ◽  
Henry P. Wynn
Keyword(s):  
Reliability Analysis ◽  
Algebraic Algorithms

Disjoint directed cycles with specified lengths in directed bipartite graphs

2021 ◽  
Vol 344 (4) ◽  
pp. 112276
Author(s):  
Yunshu Gao ◽  
Hong Wang ◽  
Qingsong Zou
Keyword(s):  
Bipartite Graphs ◽  
Directed Cycles

scholarly journals An improved bound for disjoint directed cycles

2018 ◽  
Vol 341 (8) ◽  
pp. 2231-2236 ◽  
Author(s):  
Matija Bucić
Keyword(s):  
Directed Cycles

Conditions for the Separability of Objects in Two-Dimensional Velocity Fields

1992 ◽  
Vol 35 (4) ◽  
pp. 484-491
Author(s):  
Stephan Foldes
Keyword(s):  
Velocity Field ◽  
Directed Graph ◽  
Velocity Fields ◽  
Sufficient Condition ◽  
Two Dimensional ◽  
Jordan Curves ◽  
Directed Cycles

AbstractWe consider the directed graph representing the obstruction relation between objects moving along the streamlines of a two-dimensional velocity field. A collection of objects is sequentially separable if and only if the corresponding graph has no directed cycles. A sufficient condition for this is the permeability of closed Jordan curves.

Sign in / Sign up

Export Citation Format

Share Document