Muhammad Kamran Siddiqui

  • Citations Per Year
Learn More
A massive of early drug tests implies that there exist strong inner relationships between the bio-medical and pharmacology characteristics of drugs and their molecular structures. The forgotten topological index was defined to be used in the analysis of drug molecular structures, which is quite helpful for pharmaceutical and medical scientists to grasp the(More)
An edge irregular total k-labeling of a graph G = (V,E) is a labeling φ : V ∪ E → {1, 2, . . . , k} such that the total edge-weights wt(xy) = φ(x) + φ(xy) + φ(y) are different for all pairs of distinct edges. The minimum k for which the graph G has an edge irregular total k-labeling is called the total edge irregularity strength of G. In this paper, we(More)
An edge irregular total k-labeling φ:V(G)∪E(G)→{1,2,…,k} of a graph G=(V,E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x′y′ their weights φ(x)+φ(xy)+φ(y) and φ(x′)+φ(x′y′)+φ(y′) are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total(More)
Dendrimers are highly branched organic macromolecules with successive layers or generations of branch units surrounding a central core (Ashrafi and Mirzargar, 2008 [3]; Chen et al., 2014 [7]; Klajnert and Bryszewska, 2001 [26]; Yamamoto et al., 2002 [36]). These are key molecules in nanotechnology and can be put to good use. Topological indices are numbers(More)
School of Information Science and Technology, Yunnan Normal University, Kunming 650500, China Department of Applied Mathematics, Iran University of Science and Technology (IUST) Narmak, Tehran, 16844, Iran Department of Mathematics, Riphah Institute of Computing and Applied Sciences (RICAS) Riphah International University, 14 Ali Road Lahore, Pakistan(More)
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1, 2, . . . , k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex(More)
We investigate a modification of well known irregularity strength of graph, namely the total edge irregularity strength. An edge irregular total k-labeling φ : V ∪E → {1, 2, . . . , k} of a graph G is a labeling of vertices and edges of G in such a way that for any two different edges uv and u′v′ their weights φ(u)+φ(uv)+φ(v) and φ(u′)+φ(u′v′)+φ(v′) are(More)