Papers by Hafiz Muhammad Afzal Siddiqui
Peer-to-Peer Networking and Applications
Far East Journal of Mathematical Sciences, 2017
Combinatorial Chemistry & High Throughput Screening, 2022
Background: Sierpinski graphs !(!, !) are largely studied because of their fractal nature with ap... more Background: Sierpinski graphs !(!, !) are largely studied because of their fractal nature with applications in topology, chemistry, mathematics of Tower of Hanoi and computer sciences. Applications of molecular structure descriptors are a standard procedure which are used to correlate the biological activity of molecules with their chemical structures, and thus can be helpful in the field of pharmacology. Objective: The aim of this article is to establish analytically closed computing formulae for eccentricity-based descriptors of Sierpinski networks and their regularizations. These computing formulae are useful to determine a large number of properties like thermodynamic properties, physicochemical properties, chemical and biological activity of chemical graphs. Methods: At first, vertex sets have been partitioned on the basis of their degrees, eccentricities and frequencies of occurrence. Then these partitions are used to compute the eccentricity-based indices with the aid of some...
Canadian Journal of Chemistry, 2017
The Randić (product) connectivity index and its derivative called the sum-connectivity index are ... more The Randić (product) connectivity index and its derivative called the sum-connectivity index are well-known topological indices and both of these descriptors correlate well among themselves and with the π-electronic energies of benzenoid hydrocarbons. The general n connectivity of a molecular graph G is defined as [Formula: see text] and the n sum connectivity of a molecular graph G is defined as [Formula: see text], where the paths of length n in G are denoted by [Formula: see text] and the degree of each vertex vi is denoted by di. In this paper, we discuss third connectivity and third sum-connectivity indices of diamond-like networks and compute analytical closed results of these indices for diamond-like networks.
Topological indices are numerical parameters of a graph which characterize its topology and are u... more Topological indices are numerical parameters of a graph which characterize its topology and are usually graph invariant. In this paper, bounds for the Randić, general Randić, sum-connectivity, the general sum-connectivity and harmonic indices for tensor product of graphs are determined by using the combinatorial inequalities and combinatorial computing.
Combinatorial chemistry & high throughput screening, 2021
BACKGROUND A topological index is a real number associated to a graph, that provides information ... more BACKGROUND A topological index is a real number associated to a graph, that provides information about its physical and chemical properties along with their correlations.Topological indices are being used successfully in Chemistry, Computer Science and many other fields. AIM AND OBJECTIVE In this article, we apply the well known, Cartesian product on F-sums of connected and finite graphs. We formulate sharp limits for some famous degree dependent indies. RESULTS Zagreb indices for the graph operations T(G), Q(G), S(G), R(G) and their F-sums have been computed. By using orders and sizes of component graphs, we derive bounds for Zagreb indices, F-index and Narumi-Katayana index. CONCLUSION The formulation of expressions for the complicated products on F-sums, in terms of simple parameters like maximum and minimum degrees of basic graphs, reduces the computational complexities.
Resolvability in graphs has appeared in numerous applications of graph theory, e.g. in pattern re... more Resolvability in graphs has appeared in numerous applications of graph theory, e.g. in pattern recognition, image processing, robot navigation in networks, computer sciences, combinatorial optimization, mastermind games, coin-weighing problems, etc. It is well known fact that computing the metric dimension for an arbitrary graph is an NP-complete problem. Therefore, a lot of research has been done in order to compute the metric dimension of several classes of graphs. Apart from calculating the metric dimension of graphs, it is natural to ask for the characterization of graph families with respect to the nature of their metric dimension. In this thesis, we study two important parameters of resolvability, namely the metric dimension and partition dimension. Partition dimension is a natural generalization of metric dimension as well as a standard graph decomposition problem where we require that distance code of each vertex in a partition set is distinct with respect to the other parti...
Mathematical Problems in Engineering
Let G be a simple connected graph. Suppose Δ = Δ 1 , Δ 2 , … , Δ l an l -partition of V G . A par... more Let G be a simple connected graph. Suppose Δ = Δ 1 , Δ 2 , … , Δ l an l -partition of V G . A partition representation of a vertex α w . r . t Δ is the l − vector d α , Δ 1 , d α , Δ 2 , … , d α , Δ l , denoted by r α | Δ . Any partition Δ is referred as resolving partition if ∀ α i ≠ α j ∈ V G such that r α i | Δ ≠ r α j | Δ . The smallest integer l is referred as the partition dimension pd G of G if the l -partition Δ is a resolving partition. In this article, we discuss the partition dimension of kayak paddle graph, cycle graph with chord, and a graph generated by chain of cycles. It has been shown that the partition dimension of the said families of graphs is constant.
Polycyclic Aromatic Compounds
Polycyclic Aromatic Compounds
Journal of Mathematical Inequalities
Polycyclic Aromatic Compounds
Main Group Metal Chemistry
Sierpiński graphs are family of fractal nature graphs having applications in mathematics of Tower... more Sierpiński graphs are family of fractal nature graphs having applications in mathematics of Tower of Hanoi, topology, computer science, and many more diverse areas of science and technology. This family of graphs can be generated by taking certain number of copies of the same basic graph. A topological index is the number which shows some basic properties of the chemical structures. This article deals with degree based topological indices of uniform subdivision of the generalized Sierpiński graphs S(n,G) and Sierpiński gasket Sn . The closed formulae for the computation of different kinds of Zagreb indices, multiple Zagreb indices, reduced Zagreb indices, augmented Zagreb indices, Narumi-Katayama index, forgotten index, and Zagreb polynomials have been presented for the family of graphs.
Open Chemistry
Energy of a molecule plays an important role in physics, chemistry and biology. In mathematics, t... more Energy of a molecule plays an important role in physics, chemistry and biology. In mathematics, the concept of energy is used in graph theory to help other subjects such as chemistry and physics. In graph theory, nullity is the number of zeros extracted from the characteristic polynomials obtained from the adjacency matrix, and inertia represents the positive and negative eigenvalues of the adjacency matrix. Energy is the sum of the absolute eigenvalues of its adjacency matrix. In this study, the inertia, nullity and signature of the aforementioned structures have been discussed.
International Journal of Nonlinear Sciences and Numerical Simulation
In this paper, we classify G-circuits of length 10 with the help of the location of the reduced n... more In this paper, we classify G-circuits of length 10 with the help of the location of the reduced numbers lying on G-circuit. The reduced numbers play an important role in the study of modular group action on P S L ( 2 , Z ) $PSL(2,\mathbb{Z})$ -subset of Q ( m ) \ Q $Q(\sqrt{m}){\backslash}Q$ . For this purpose, we define new notions of equivalent, cyclically equivalent, and similar G-circuits in P S L ( 2 , Z ) $PSL(2,\mathbb{Z})$ -orbits of real quadratic fields. In particular, we classify P S L ( 2 , Z ) $PSL(2,\mathbb{Z})$ -orbits of Q ( m ) \ Q $Q(\sqrt{m}){\backslash}Q$ = ⋃ k ∈ N Q * k 2 m $={\bigcup }_{k\in N}{Q}^{{\ast}}\left(\sqrt{{k}^{2}m}\right)$ containing G-circuits of length 10 and determine that the number of equivalence classes of G-circuits of length 10 is 41 in number. We also use dihedral group to explore cyclically equivalence classes of circuits and use cyclic group to explore similar G-circuits of length 10 corresponding to 10 of these circuits. By using cyclica...
Journal of Chemistry
A topological index is a characteristic value which represents some structural properties of a ch... more A topological index is a characteristic value which represents some structural properties of a chemical graph. We study strong double graphs and their generalization to compute Zagreb indices and Zagreb coindices. We provide their explicit computing formulas along with an algorithm to generate and verify the results. We also find the relation between these indices. A 3D graphical representation and graphs are also presented to understand the dynamics of the aforementioned topological indices.
Polycyclic Aromatic Compounds
AIMS Mathematics
Zero forcing is a process of coloring in a graph in time steps known as propagation time. These g... more Zero forcing is a process of coloring in a graph in time steps known as propagation time. These graph-theoretic parameters have diverse applications in computer science, electrical engineering and mathematics itself. The problem of evaluating these parameters for a network is known to be NPhard. Therefore, it is interesting to study these parameters for special families of networks. Perila et al. (2017) studied properties of these parameters for some basic oriented graph families such as cycles, stars and caterpillar networks. In this paper, we extend their study to more non-trivial structures such as oriented wheel graphs, fan graphs, friendship graphs, helm graphs and generalized comb graphs. We also investigate the change in propagation time when the orientation of one edge is flipped.
Arabian Journal of Chemistry
Journal of Mathematics
Reduced numbers play an important role in the study of modular group action on the PSL2,ℤ-subset ... more Reduced numbers play an important role in the study of modular group action on the PSL2,ℤ-subset of Qm/Q. For this purpose, we define new notions of equivalent, cyclically equivalent, and similar G-circuits in PSL2,ℤ-orbits of real quadratic fields. In particular, we classify PSL2,ℤ-orbits of Qm/Q=∪k∈NQ∗k2m containing G-circuits of length 6 and determine that the number of equivalence classes of G-circuits of length 6 is ten. We also employ the icosahedral group to explore cyclically equivalence classes of circuits and similar G-circuits of length 6 corresponding to each of these ten circuits. This study also helps us in classifying reduced numbers lying in the PSL2,ℤ-orbits.
Uploads
Papers by Hafiz Muhammad Afzal Siddiqui