Extended cut method for edge Wiener, Schultz and Gutman indices with applications
From MaRDI portal
Publication:5280050
zbMATH Open1461.05036MaRDI QIDQ5280050FDOQ5280050
Authors: Micheal Arockiaraj, Arul Jeya Shalini 
Publication date: 19 July 2017
Recommendations
- Calculating the edge Wiener and edge Szeged indices of graphs
- Generalizations of some topological indices
- Generalized cut method for computing the edge-Wiener index
- Wiener and Schultz molecular topological indices of graphs with specified cut edges
- Counting polynomials and related indices by edge cutting procedures
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Distance in graphs (05C12)
Cited In (14)
- The edge-Wiener index and the edge-hyper-Wiener index of phenylenes
- Title not available (Why is that?)
- Calculating the edge Wiener and edge Szeged indices of graphs
- Hyper-Wiener and Wiener polarity indices of silicate and oxide frameworks
- The cut method on hypergraphs for the Wiener index
- Counting polynomials and related indices by edge cutting procedures
- General transmission lemma and Wiener complexity of triangular grids
- A bird's eye view of the cut method and a survey of its applications in chemical graph theory
- Vertex cut method for degree and distance-based topological indices and its applications to silicate networks
- Title not available (Why is that?)
- Generalized cut method for computing the edge-Wiener index
- Chromatic Schultz and Gutman polynomials of Jahangir graphs \(J_{2, m}\) and \(J_{3, m}\)
- Stepwise irregular graphs
- Gutman index -- a critical personal account
This page was built for publication: Extended cut method for edge Wiener, Schultz and Gutman indices with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280050)
