Header menu link for other important links
X
Regularity of binomial edge ideals of certain block graphs
, , B. V. Raghavendra Rao
Published in Springer
2019
Volume: 129
   
Issue: 3
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. © 2019, Indian Academy of Sciences.
About the journal
JournalData powered by TypesetProceedings of the Indian Academy of Sciences: Mathematical Sciences
PublisherData powered by TypesetSpringer
ISSN02534142
Open AccessYes
Concepts (10)
  •  related image
    Forestry
  •  related image
    Graphic methods
  •  related image
    BINOMIAL EDGE IDEALS
  •  related image
    BLOCK GRAPHS
  •  related image
    Lower bounds
  •  related image
    Tree
  •  related image
    TWO-GRAPHS
  •  related image
    Upper and lower bounds
  •  related image
    Upper bound
  •  related image
    Trees (mathematics)