• Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/pmsc/129/03/0036

    • Keywords

       

      Binomial edge ideals; Castelnuovo–Mumford regularity; block graph; tree

    • Abstract

       

      We prove that the regularity of binomial edge ideals of graphs obtained by gluing two graphs at a free vertex is the sum of the regularity of individual graphs. As a consequence, we generalize certain results of Zafar and Zahid (Electron J Comb 20(4), 2013). We obtain an improved lower bound for the regularity of trees. Further, we characterize trees which attain the lower bound. We prove an upper bound for the regularity of certain subclass of block-graphs. As a consequence, we obtain sharp upper and lower bounds for a class of trees called lobsters.

    • Author Affiliations

       

      A V JAYANTHAN1 N NARAYANAN1 B V RAGHAVENDRA RAO2

      1. Department of Mathematics, Indian Institute of Technology Madras, Chennai 600 036, India
      2. Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai 600 036, India
    • Dates

       
  • Proceedings – Mathematical Sciences | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.