Counting polynomials and related indices by edge cutting procedures
From MaRDI portal
Publication:3144343
zbMATH Open1265.05306MaRDI QIDQ3144343FDOQ3144343
Authors: Mircea V. Diudea
Publication date: 7 December 2012
Recommendations
- Calculating the edge Wiener and edge Szeged indices of graphs
- Extended cut method for edge Wiener, Schultz and Gutman indices with applications
- Generalized cut method for computing the edge-Wiener index
- Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones
- Edge-decomposition of topological indices
topological indexWiener indexSzeged indexbiological propertiesCluj indexCluj-Ilmenau indexedge cutting proceduresphysic-chemical properties
Applications of graph theory (05C90) Graph polynomials (05C31) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cited In (7)
- Graphene Derivatives: Carbon Nanocones and CorSu Lattice: A Topological Approach
- First and second extremal bipartite graphs with respect to PI index
- Omega polynomial in nanostructures
- On topological indices for small RNA graphs
- On the Cluj-Ilmenau index of a family of benzenoid systems
- Cluj polynomials
- Extended cut method for edge Wiener, Schultz and Gutman indices with applications
This page was built for publication: Counting polynomials and related indices by edge cutting procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3144343)