Showing math.COShow all
2 papers · 1 filter
math.CO2021
Diameter and connectivity of finite simple graphs
Takayuki Hibi, Sara Saeedi Madani
Let be a finite simple non-complete connected graph on and its vertex connectivity. Let denote the number of free vertices of and $\…
math.CO2014
Binomial edge ideals with pure resolutions
Dariush Kiani, Sara Saeedi Madani
We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of gra…