On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph
From MaRDI portal
Publication:6648287
DOI10.1016/J.DAM.2024.10.008MaRDI QIDQ6648287
Publication date: 4 December 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) 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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On difference of Zagreb indices
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- Extremal graphs for weights
- A Turán type problem concerning the powers of the degrees of a graph
- New asymptotics for bipartite Turán numbers
- Some results on \(k\)-Turán-good graphs
- Some exact results for generalized Turán problems
- Generalized Turán problems for even cycles
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- On general sum-connectivity index
- A forgotten topological index
- The Zagreb indices of graphs with a given clique number
- Generalized Turán problems for \(K_{2,t}\)
- Some exact results of the generalized Turán numbers for paths
- Graphs of extremal weights
- Beyond the Zagreb indices
- On a problem of K. Zarankiewicz
- Many \(T\) copies in \(H\)-free graphs
- Generalized Turán problems for double stars
- Extremal problems of double stars
- On the maximum number of copies of H in graphs with given size and order
- Some exact results for non-degenerate generalized Turán problems
- Some Stability and Exact Results in Generalized Turán Problems
- Every graph is eventually Turán-good
- The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs
This page was built for publication: On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648287)