Leapfrog fullerenes and Wiener index

DOI10.1016/j.amc.2017.03.043zbMath1411.92343OpenAlexW2606154185MaRDI QIDQ1738122

Riste Škrekovski, Damir Orlić, Vesna Andova

Publication date: 29 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.03.043

zbMATH Keywords

distanceWiener indexfullerenemolecular descriptor

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (3)

Maximum external Wiener index of graphs ⋮ On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs ⋮ An inequality between variable Wiener index and variable Szeged index

Cites Work

• Some remarks on Wiener index of oriented graphs
• An inequality between the edge-Wiener index and the Wiener index of a graph
• Finding more perfect matchings in leapfrog fullerenes
• Leapfrog fullerenes have many perfect matchings
• Mathematical aspects of fullerenes
• Sandwiching saturation number of fullerene graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Leapfrog fullerenes and Wiener index