Bond incident degree indices of connected (n, m)-graphs with fixed maximum degree
DOI10.46793/MATCH.92-2.607AzbMATH Open1542.92213MaRDI QIDQ6586313FDOQ6586313
Authors: Abeer M. Albalahi, Darko Dimitrov, Tamás Réti, Akbar Ali, Shah Hussain 
Publication date: 13 August 2024
Published in: MATCH - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- Graph theory
- On a novel connectivity index
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximizing the sum of the squares of the degrees of a graph
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
- Augmented Zagreb index
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complete characterization of the minimal-ABC trees
- Extremal Graphs for Topological Index Defined by a Degree-Based Edge-Weight Function
- On the extremal graphs with respect to bond incident degree indices
- Bond incident degree (BID) indices of polyomino chains: a unified approach
- 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
- Title not available (Why is that?)
- On (exponential) bond incident degree indices of graphs
- Atom–bond connectivity index of graphs: a review over extremal results and bounds
- Title not available (Why is that?)
- The evolution of the structure of ABC-minimal trees
- Atom-bond sum-connectivity index
- Sombor index: review of extremal results and bounds
- Title not available (Why is that?)
- Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions
- Extremal Problems for Graphical Function-Indices and f-Weighted Adjacency Matrix
- On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves
- 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
- Title not available (Why is that?)
- Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs
Cited In (2)
This page was built for publication: Bond incident degree indices of connected \((n, m)\)-graphs with fixed maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586313)
