Unified extremal results for (exponential) bond incident degree indices of trees

DOI10.46793/MATCH.92-1.151LzbMATH Open1542.92222MaRDI QIDQ6563237FDOQ6563237

Authors: Hechao Liu, Lihua You, Hanlin Chen, Yufei Huang 

Publication date: 27 June 2024

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

Recommendations

• On the extremal graphs with respect to bond incident degree indices
• Maximum bond incident degree indices of trees with given independence number
• On (exponential) bond incident degree indices of graphs
• On bond incident degree indices of \((n,m)\)-graphs
• Extremal triangular chain graphs for bond incident degree (BID) indices.

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Cites Work

• Graph theory
• Title not available (Why is that?)
• A unified approach to the extremal trees for different indices
• Unified extremal results of topological indices and spectral invariants of graphs
• Title not available (Why is that?)
• Chemical Trees with Maximal VDB Topological Indices
• The path and the star as extremal values of vertex-degree-based topological indices among trees
• On the extremal graphs with respect to bond incident degree indices
• Bond incident degree (BID) indices of polyomino chains: a unified approach
• Unified extremal results for vertex-degree-based graph invariants with given diameter
• On bond incident degree indices of connected graphs with fixed order and number of pendent vertices
• On bond incident degree indices of \((n,m)\)-graphs
• Trees with maximum vertex-degree-based topological indices
• Trees with extremal spectral radius of weighted adjacency matrices among trees weighted by degree-based indices
• Exponential vertex-degree-based topological indices and discrimination
• An open problem on the exponential of the second Zagreb index
• The second-minimum and second-maximum values of exponential Zagreb indices among trees
• Extremal unicyclic graphs with respect to vertex-degree-based topological indices
• Unicyclic and bicyclic graphs with maximum exponential second Zagreb index
• Extremal values of vertex-degree-based topological indices of chemical trees
• Extremal problems for graphical function-indices and \(f\)-weighted adjacency matrix
• The exponential second Zagreb index of \((n, m)\)-graphs
• Extremal trees and unicyclic graphs with respect to spectral radius of weighted adjacency matrices with property \(P^*\)
• \((n, m)\)-graphs with maximum exponential second Zagreb index
• Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs
• On exponential geometric-arithmetic index of graphs

Cited In (4)

• Extremal results and bounds for atom-bond sum-connectivity index
• Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs
• Maximum bond incident degree indices of trees with given independence number
• On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves

This page was built for publication: Unified extremal results for (exponential) bond incident degree indices of trees

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