Next Article in Journal
Time-Consistent Investment-Reinsurance Strategies for the Insurer and the Reinsurer under the Generalized Mean-Variance Criteria
Next Article in Special Issue
Syzygies, Betti Numbers, and Regularity of Cover Ideals of Certain Multipartite Graphs
Previous Article in Journal
Existence Results for Block Matrix Operator of Fractional Orders in Banach Algebras
Previous Article in Special Issue
Faces of 2-Dimensional Simplex of Order and Chain Polytopes
Open AccessArticle

Algebraic Algorithms for Even Circuits in Graphs

by Huy Tài Hà 1 and Susan Morey 2,*
1
Department of Mathematics, Tulane University, 6823 St. Charles Avenue, New Orleans, LA 70118, USA
2
Department of Mathematics, Texas State University, 601 University Drive, San Marcos, TX 78666, USA
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(9), 859; https://doi.org/10.3390/math7090859
Received: 1 July 2019 / Revised: 9 September 2019 / Accepted: 12 September 2019 / Published: 17 September 2019
(This article belongs to the Special Issue Current Trends on Monomial and Binomial Ideals)
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. View Full-Text
Keywords: graph; circuit; even cycle; directed cycle; monomial ideal; Rees algebra; edge ideal graph; circuit; even cycle; directed cycle; monomial ideal; Rees algebra; edge ideal
MDPI and ACS Style

Hà, H.T.; Morey, S. Algebraic Algorithms for Even Circuits in Graphs. Mathematics 2019, 7, 859.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop