On bond incident degree indices of connected graphs with fixed order and number of pendent vertices
From MaRDI portal
Publication:5050737
Recommendations
- Extremal Zagreb indices of graphs of order \(n\) with \(p\) pendent vertices
- On the extremal graphs with respect to bond incident degree indices
- On bond incident degree indices of \((n,m)\)-graphs
- Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index
- Minimizing degree-based topological indices for trees with given number of pendent vertices
Cites work
- scientific article; zbMATH DE number 5015715 (Why is no real title available?)
- scientific article; zbMATH DE number 6506585 (Why is no real title available?)
- scientific article; zbMATH DE number 7427118 (Why is no real title available?)
- A unified approach to the extremal trees for different indices
- An extremal problem on degree sequences of graphs
- Extremal Zagreb indices of graphs of order \(n\) with \(p\) pendent vertices
- Extremal graphs for topological index defined by a degree-based edge-weight function
- Extremal problems for graphical function-indices and \(f\)-weighted adjacency matrix
- Extremal results for cacti
- Functions on adjacent vertex degrees of trees with given degree sequence
- Graph theory
- Graphs of extremal weights
- Graphs with fixed number of pendent vertices and minimal first Zagreb index
- Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions
- Graphs with minimum vertex-degree function-index for convex functions
- On a novel connectivity index
- On bond incident degree indices of \((n,m)\)-graphs
- On general sum-connectivity index
- On the extremal graphs with respect to bond incident degree indices
- Some extremal graphs with respect to inverse degree
- Unified extremal results of topological indices and spectral invariants of graphs
Cited in
(12)- Some bounds on bond incident degree indices with some parameters
- Bond incident degree (BID) indices of polyomino chains: a unified approach
- Unified extremal results for (exponential) bond incident degree indices of trees
- Bond incident degree indices of connected \((n, m)\)-graphs with fixed maximum degree
- On bond incident degree indices of \((n,m)\)-graphs
- General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index
- \((n, m)\)-graphs with maximum exponential second Zagreb index
- Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs
- Some bond incident degree indices of (molecular) graphs with fixed order and number of cut vertices
- Extremal Zagreb indices of graphs of order \(n\) with \(p\) pendent vertices
- Degree-based function index for graphs with given diameter
- On (exponential) bond incident degree indices of graphs
This page was built for publication: On bond incident degree indices of connected graphs with fixed order and number of pendent vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050737)