IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v4y2016i2p37-d71227.html
   My bibliography  Save this article

Smoothness in Binomial Edge Ideals

Author

Listed:
  • Hamid Damadi

    (Faculty of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Ave, Tehran 15914, Iran)

  • Farhad Rahmati

    (Faculty of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Ave, Tehran 15914, Iran)

Abstract

In 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.

Suggested Citation

  • Hamid Damadi & Farhad Rahmati, 2016. "Smoothness in Binomial Edge Ideals," Mathematics, MDPI, vol. 4(2), pages 1-6, June.
    • Handle: RePEc:gam:jmathe:v:4:y:2016:i:2:p:37-:d:71227
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/4/2/37/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/4/2/37/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:4:y:2016:i:2:p:37-:d:71227. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.