Computing Analysis of Zagreb Indices for Generalized Sum Graphs under Strong Product | Zendy

Muhammad Javaid | Zendy; Saira Javed | Zendy; Abdulaziz M. Alanazi | Zendy; Majdah R. Alotaibi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Computing Analysis of Zagreb Indices for Generalized Sum Graphs under Strong Product

Author(s) -

Muhammad Javaid,

Saira Javed,

Abdulaziz M. Alanazi,

Majdah R. Alotaibi

Publication year - 2021

Publication title -

journal of chemistry

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.436

H-Index - 50

eISSN - 2090-9063

pISSN - 2090-9071

DOI - 10.1155/2021/6663624

Subject(s) - subdivision , graph product , product (mathematics) , pathwidth , graph , indifference graph , chemistry , chordal graph , combinatorics , graph theory , 1 planar graph , line graph , mathematics , engineering , civil engineering , geometry

Numerous studies based on mathematical models and tools indicate that there is a strong inherent relationship between the chemical properties of the chemical compounds and drugs with their molecular structures. In the last two decades, the graph-theoretic techniques are frequently used to analyse the various physicochemical and structural properties of the molecular graphs which play a vital role in chemical engineering and pharmaceutical industry. In this paper, we compute Zagreb indices of the generalized sum graphs in the form of the different indices of their factor graphs, where generalized sum graphs are obtained under the operations of subdivision and strong product of graphs. Moreover, the obtained results are illustrated with the help of particular classes of graphs and analysed to find the efficient subclass with dominant indices.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research