Search Results

You are looking at 1 - 3 of 3 items for

  • Author: Sohail Zafar x
Clear All Modify Search
Open access

Peter Schenzel and Sohail Zafar

Abstract

Let JG denote the binomial edge ideal of a connected undirected graph on n vertices. This is the ideal generated by the binomials xiyj − xjyi, 1 ≤ i < j≤ n, in the polynomial ring S = K[x 1, . . . , xn, y 1, . . . , yn] where {i, j} is an edge of G. We study the arithmetic properties of S/JG 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/JG.

Open access

Muhammad Shoaib Sardar, Sohail Zafar and Zohaib Zahid

Abstract

In this paper, we compute first Zagreb index (coindex), second Zagreb index (coindex), third Zagreb index, first hyper-Zagreb index, atom-bond connectivity index, fourth atom-bond connectivity index, sum connectivity index, Randić connectivity index, augmented Zagreb index, Sanskruti index, geometric-arithmetic connectivity index and fifth geometric-arithmetic connectivity index of the line graphs of Banana tree graph and Firecracker graph.

Open access

Yasir Ahmad, Umer Ali, Muhammad bilal, Sohail Zafar and Zohaib Zahid

Abstract

In this paper, we study 3–total edge product cordial (3–TEPC) labeling which is a variant of edge product cordial labeling. We discuss Web, Helm, Ladder and Gear graphs in this context of 3–TEPC labeling. We also discuss 3–TEPC labeling of some particular examples with corona graph.