First Zagreb index, k-connectivity, -deficiency and k-Hamiltonicity of graphs
From MaRDI portal
Publication:4956504
Recommendations
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs
- Zagreb \(M_1\) index, independence number and connectivity in graphs
- Wiener index, Harary index and graph properties
- Further properties of Zagreb indices
Cited in
(14)- The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs
- Sharp bounds on certain degree based topological indices for generalized Sierpiński graphs
- On reduced second Zagreb index
- \(M\)-polynomial revisited: Bethe cacti and an extension of Gutman's approach
- Open problems on the exponential vertex-degree-based topological indices of graphs
- Sufficient conditions for a graph to be k-edge-Hamiltonian, k-path-coverable, traceable and Hamilton-connected
- The topological indices and some Hamiltonian properties of graphs
- On sufficient conditions for Hamiltonicity of graphs, and beyond
- Sufficient conditions for k-leaf-connected graphs in terms of the first Zagreb index, the reciprocal degree distance and the forgotten topological index
- Some sufficient conditions for graphs to be k-leaf-connected
- Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices
- Extremal values of two multiplicative type topological indices
- Several graph properties in terms of the multiplicative version of the first Zagreb index
- Results on k-leaf-connected graphs and digraphs: a survey
This page was built for publication: First Zagreb index, \(k\)-connectivity, \( \beta \)-deficiency and \(k\)-Hamiltonicity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956504)
