Degree-Based Topological Properties of Molecular Polymeric Networks Composed by Sierpinski Networks

Sierpinski graphs are a widely observed family of fractal-type graphs relevant to topology, Hanoi Tower mathematics, computer engineering, and around. Chemical implementations of graph theory establish significant properties, such as chemical activity, physicochemical properties, thermodynamic properties, and pharmacological activities of a molecular graph. Specific graph descriptors alluded to as topological indices are helpful to predict these properties. These graph descriptors have played a key role in quantitative structure-property/structure-activity relationships (QSPR/QSAR) research. The objective of this article is to compute Randic index ( R − 1 / 2 ), Zagreb index M 1 , sum-connectivity index SCI , geometric-arithmetic index GA , and atom-bond connectivity ABC index based on ev-degree and ve-degree for the Sierpinski networks S n , m .

Some topological properties of uniform subdivision of Sierpiński graphs

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.

Italian domination on Mycielskian and Sierpinski graphs

An Italian dominating function (IDF) of a graph G is a function [Formula: see text] satisfying the condition that for every [Formula: see text] with [Formula: see text] The weight of an IDF on [Formula: see text] is the sum [Formula: see text] and Italian domination number, [Formula: see text] is the minimum weight of an IDF. In this paper, we prove that [Formula: see text] where [Formula: see text] is the Mycielskian graph of [Formula: see text]. We have also studied the impact of edge addition on Italian domination number. We also obtain a bound for the Italian domination number of Sierpinski graph [Formula: see text] and find the exact value of [Formula: see text].