arXiv subjects
Publications and source records attributed to Sohail Zafar.
In this paper, we introduce the edge version of doubly resolving set of a graph which is based on the edge distances of the graph. As a main result, we computed the minimum cardinality $ψ_E$ of edge version of doubly resolving sets of family of $n$-sunlet graph $S_n$ and prism graph $Y_n$.
We study the Betti numbers of binomial edge ideal associated to some classes of graphs with large Castelnuovo-Mumford regularity. As an application we give several lower bounds of the Castelnuovo-Mumford regularity of arbitrary graphs depending on induced subgraphs.
Binomial edge ideals IG of a graph G were introduced by [4]. They found some classes of graphs G with the property that IG is a Cohen-Macaulay ideal. This might happen only for few classes of graphs. A certain generalization of being Cohen-Macaulay, named approximately Cohen-Macaulay, was introduced by S. Goto in [3]. We study classes of graphs whose binomial edge ideal are approximately Cohen-Macaulay. Moreover we use some homological methods in order to compute their Hilbert series.
Let $J_G$ denote the binomial edge ideal of a connected undirected graph on $n$ vertices. This is the ideal generated by the binomials $x_iy_j - x_jy_i, 1\leq i < j \leq n,$ in the polynomial ring $S= K[x_1,...,x_n,y_1,...,y_n]$ where $\{i,j\}$ is an edge of $G$. We study the arithmetic properties of $S/J_G$ for $G$, the complete bipartite graph. In particular we compute dimensions, depths, Castelnuovo-Mumford regularities, Hilbert functions and multiplicities of them. As main results we give an explicit description of the modules of deficiencies, the duals of local cohomology modules, and prove the purity of the minimal free resolution of $S/J_G$.