Maximum bond incident degree indices of trees with given independence number
From MaRDI portal
Publication:6630957
DOI10.46793/match.93-2.567tMaRDI QIDQ6630957
Publication date: 31 October 2024
Published in: MATCH - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)
Trees (05C05) 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?)
- 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 of topological indices and spectral invariants of graphs
- Extremal Graphs for Topological Index Defined by a Degree-Based Edge-Weight Function
- Trees with Maximum Vertex-Degree-Based Topological Indices
- General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index
- Unified extremal results for (exponential) bond incident degree indices of trees
This page was built for publication: Maximum bond incident degree indices of trees with given independence number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6630957)
