On Bond Incident Degree Indices of Connected Graphs with Fixed Order and Number of Pendent Vertices
DOI10.46793/MATCH.88-3.625ZzbMATH Open1505.92305OpenAlexW4281479801MaRDI QIDQ5050737FDOQ5050737
Author name not available (Why is that?)
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://doi.org/10.46793/match.88-3.625z
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
- 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?)
- On a novel connectivity index
- On general sum-connectivity index
- Some extremal graphs with respect to inverse degree
- Graphs of extremal weights
- Functions on adjacent vertex degrees of trees with given degree sequence
- An extremal problem on degree sequences of graphs
- Unified extremal results of topological indices and spectral invariants of graphs
- Extremal Graphs for Topological Index Defined by a Degree-Based Edge-Weight Function
- On the extremal graphs with respect to bond incident degree indices
- On bond incident degree indices of (n,m) -graphs
- Extremal results for cacti
- Graphs with Minimum Vertex-Degree Function-Index for Convex Functions
- 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
Cited In (10)
- 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
- 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
- Degree-based function index for graphs with given diameter
- On (exponential) bond incident degree indices of graphs
- Some bounds on bond incident degree indices with some parameters
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)
