Bond incident degree indices of connected \((n, m)\)-graphs with fixed maximum degree
From MaRDI portal
Publication:6586313
DOI10.46793/match.92-2.607azbMATH Open1542.92213MaRDI QIDQ6586313
Darko Dimitrov, Abeer M. Albalahi, Shah Hussain, Tamás Réti, Akbar Ali
Publication date: 13 August 2024
Published in: MATCH - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)
Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a novel connectivity index
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
- On the extremal graphs with respect to bond incident degree indices
- Bond incident degree (BID) indices of polyomino chains: a unified approach
- Maximizing the sum of the squares of the degrees of a graph
- Augmented Zagreb index
- Atom-bond sum-connectivity index
- Sombor index: review of extremal results and bounds
- The evolution of the structure of ABC-minimal trees
- Extremal Graphs for Topological Index Defined by a Degree-Based Edge-Weight Function
- On Bond Incident Degree Indices of Connected Graphs with Fixed Order and Number of Pendent Vertices
- Extremal Problems for Graphical Function-Indices and f-Weighted Adjacency Matrix
- On bond incident degree indices of (n,m) -graphs
- Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions
- Atom–bond connectivity index of graphs: a review over extremal results and bounds
- On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves
- On (exponential) bond incident degree indices of graphs
- Complete characterization of the minimal-ABC trees
- General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index
- Symmetric Division Deg Index: Extremal Results and Bounds
- Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs
Related Items (2)
Extremal results and bounds for atom-bond sum-connectivity index ⋮ On unicyclic graphs with a given girth and their minimum symmetric division \(\deg\) index
This page was built for publication: Bond incident degree indices of connected \((n, m)\)-graphs with fixed maximum degree