A simple algorithm for computing detour index of nanoclusters

MaRDI QIDQ2933607zbMATH OpenFDO

Authors Behzad Manouchehrian, A. R. Ashrafi

Publication date 4 December 2014

Full work available at URL http://www.ijmsi.ir/browse.php?slc_lang=en&sid=1&a_id=21

zbMATH Keywords

detour indexnoindentsilver and copper nanoclusters

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Exact enumeration problems, generating functions (05A15) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Combinatorial inequalities (05A20)

Recommendations

• Detour index of \(\text{TUC}_4\text{C}_8(\text{S})\) nanotube.
• Detour index of hexagonal chains
• Distance and detour matrices of an infinite class of dendrimer nanostars
• On detour index
• The computation of the distance matrix and the Wiener index for graphs of arbitrary complexity with weighted vertices and edges

Cited in

(3)

• Detour index of \(\text{TUC}_4\text{C}_8(\text{S})\) nanotube.
• Detour polynomials of vertex coalenscence and bridges coalenscence graphs
• On detour index of join of Hamilton-connected graphs.

This page was built for publication: A simple algorithm for computing detour index of nanoclusters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933607)