Enumeration of spanning trees in a chain of diphenylene graphs

DOI10.1080/09720529.2022.2038931zbMath1487.05251OpenAlexW4223647819WikidataQ114847679 ScholiaQ114847679MaRDI QIDQ5865679

Mohammed Reza Farahani, Hanan Ahmed, Mohamad Nazri Husin, Abdulhafid Modabish, Mehdi Alaeiyan, Abdu Alameri, Murat Cancan

Publication date: 9 June 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2022.2038931

zbMATH Keywords

Laplacian matrixspanning treeschain of diphenylenediphenylene

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Related Items (2)

ON THE SECOND DOMINATION HYPER INDEX OF GRAPH AND SOME GRAPH OPERATIONS ⋮ A Study of Families of Bistar and Corona Product of Graph: Reverse Topological Indices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination topological indices and their polynomials of a firefly graph
• Forgotten domination, hyper domination and modified forgotten domination indices of graphs
• Eccentricity based topological indices of honeycomb networks
• Modified eccentric descriptors of crystal cubic carbon
• Topological properties of benzenoid, phenylenes and nanostar dendrimers
• Computing harmonic indices of series benzenoid H_k and hydrocarbons PAH_k by use of cut method
• Studying thermodynamic properties of linear acenes molecules (C_4n+2H_2n+4) using hyper-Zagreb index
• Irregularity of Sierpinski graph
• The hyper-zagreb index for an infinite family of nanostar dendrimer

This page was built for publication: Enumeration of spanning trees in a chain of diphenylene graphs