Algebraic Algorithms for Even Circuits in Graphs

Mathematics

Susan Morey¹  HuyTài Hಠ

[1] Department of Mathematics, Texas State University, 601 University Drive, San Marcos, TX 78666, USA;Department of Mathematics, Tulane University, 6823 St. Charles Avenue, New Orleans, LA 70118, USA;

关键词: graph;    circuit;    even cycle;    directed cycle;    monomial ideal;    Rees algebra;    edge ideal;   

DOI  :  10.3390/math7090859

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown