On acyclic molecular graphs with prescribed numbers of edges that connect vertices with given degrees

DOI10.1007/S10910-005-9021-5zbMATH Open1103.92055OpenAlexW1981763111MaRDI QIDQ862886FDOQ862886

Authors: Darko Veljan, Damir Vukičević 

Publication date: 24 January 2007

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-005-9021-5

Recommendations

• scientific article; zbMATH DE number 2239319
• Comparing Zagreb \(M1\) and \(M2\) indices for acyclic molecules
• Comparing variable Zagreb \(M_1\) and \(M_2\) indices for acyclic molecules
• The connectivity and the modified second multiplicative Zagreb index of graphs
• On acrylic and unicyclic conjugated graphs with maximum Zagreb indices

zbMATH Keywords

algorithmgeneratortopological indexacyclic graphZagreb indexmolecular graphmodified Zagreb indexmolecular descriptordiscriminitavity

Mathematics Subject Classification ID

Applications of graph theory (05C90) Software, source code, etc. for problems pertaining to biology (92-04) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Which generalized Randić indices are suitable measures of molecular branching?
• On the path-Zagreb matrix
• Some bond incident degree indices of (molecular) graphs with fixed order and number of cut vertices

Uses Software

• Visual C++

This page was built for publication: On acyclic molecular graphs with prescribed numbers of edges that connect vertices with given degrees

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