In this paper, we present exact formula for the weighted PI index of corona product of two connected graphs in terms of other graph invariants including the PI index, first Zagreb index and second Zagreb index. Then, we apply our result to compute the weighted PI indices of t-fold bristled graph, bottleneck graph, sunlet graph, star graph, fan graph, wheel graph and some classes of bridge graphs.

No abstract

No abstract

Chemical graph theory is a mixture of chemistry and mathematics both play an important role in chemical graph theory. Chemistry provides a chemical compound and graph theory transform this chemical compound into a molecular graph, which are associated with some numerical values these values are known as topological indices. In this study we consider the weighted modification of new bond-additive Mostar indices that appear to provide quantitative measures of peripheral shapes of molecules. We have computed the Additively Weighted Mostar Index and Multiplicatively Weighted Mostar Index for Conical and Generalized gear graph.

On the great success of bond-additive topological indices like Szeged, Padmakar-Ivan, Zagreb, and irregularity measures, yet another index, the Mostar index, has been introduced recently as a peripherality measure in molecular graphs and networks. For a connected graph G, the Mostar index is defined as $$M_{o}(G)=\displaystyle{\sum\limits_{e=gh\epsilon E(G)}}C(gh),$$ where $C(gh) \,=\,\left|n_{g}(e)-n_{h}(e)\right|$ be the contribution of edge $uv$ and $n_{g}(e)$ denotes the number of vertices of $G$ lying closer to vertex $g$ than to vertex $h$ ($n_{h}(e)$ define similarly). In this paper, we prove a general form of the results obtained by $Do\check{s}li\acute{c}$ et al.\cite{18} for compute the Mostar index to the Cartesian product of two simple connected graph. Using this result, we have derived the Cartesian product of paths, cycles, complete bipartite graphs, complete graphs and to some molecular graphs.

No abstract

No abstract

Let C 2p and pK 2 denote a cycle with 2p edges and p vertex-disjoint edges, respectively. For graphs G, H and H , a (H , H)-multidecomposition of G is a partition of the edge set of G into copies of H and copies of H with at least one copy of H and at least one copy of H. In this paper, we investigate (C 2p , pK 2)-multidecomposition of the Cartesian product of paths, cycles and complete graphs, for some values p ≥ 3.