Smoothness in Binomial Edge Ideals
AbstractIn this paper we study some geometric properties of the algebraic set associated to the binomial edge ideal of a graph. We study the singularity and smoothness of the algebraic set associated to the binomial edge ideal of a graph. Some of these algebraic sets are irreducible and some of them are reducible. If every irreducible component of the algebraic set is smooth we call the graph an edge smooth graph, otherwise it is called an edge singular graph. We show that complete graphs are edge smooth and introduce two conditions such that the graph G is edge singular if and only if it satisfies these conditions. Then, it is shown that cycles and most of trees are edge singular. In addition, it is proved that complete bipartite graphs are edge smooth. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Damadi, H.; Rahmati, F. Smoothness in Binomial Edge Ideals. Mathematics 2016, 4, 37.
Damadi H, Rahmati F. Smoothness in Binomial Edge Ideals. Mathematics. 2016; 4(2):37.Chicago/Turabian Style
Damadi, Hamid; Rahmati, Farhad. 2016. "Smoothness in Binomial Edge Ideals." Mathematics 4, no. 2: 37.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.