A relation on trees and the topological indices based on subgraph

DOI10.46793/MATCH.89-2.343SMaRDI QIDQ5050771zbMATH OpenOpenAlexFDO

Authors Rui Song, Qiongxiang Huang

Publication date 17 November 2022

Published in MATCH Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2207.03357

Mathematics Subject Classification ID

Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Abstract: A topological index reflects the physical, chemical and structural properties of a molecule, and its study has an important role in molecular topology, chemical graph theory and mathematical chemistry. It is a natural problem to characterize non-isomorphic graphs with the same topological index value. By introducing a relation on trees with respect to edge division vectors, denoted by $langlemathcal{T}_n,preceqangle$, in this paper we give some results for the relation order in $langlemathcal{T}_n,preceqangle$, it allows us to compare the size of the topological index value without relying on the specific forms of them, and naturally we can determine which trees have the same topological index value. Based on these results we characterize some classes of trees that are uniquely determined by their edge division vectors and construct infinite classes of non-isomorphic trees with the same topological index value, particularly such trees of order no more than $10$ are completely determined.

Recommendations

• On structure-sensitivity of degree-based topological indices
• scientific article; zbMATH DE number 2188382
• Edge-contributions of some topological indices and arboreality of molecular graphs
• Weakly discriminating vertex-degree-based topological indices
• Vertex-degree-based topological indices over trees with two branching vertices

Cites work

• A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
• Constructing pairs of equienergetic and non-cospectral graphs
• Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial
• Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
• scientific article; zbMATH DE number 3411062 (Why is no real title available?)
• On indices of Wiener and anti-Wiener type
• The extremal graphs of order trees and their topological indices
• The Steiner Wiener index of a graph
• Variable Wiener indices

Cited in

(3)

• On structure-sensitivity of degree-based topological indices
• Problems related to graph indices in trees
• scientific article; zbMATH DE number 168167 (Why is no real title available?)

This page was built for publication: A relation on trees and the topological indices based on subgraph

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