Comparing Zagreb indices for connected graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5382098 (Why is no real title available?)
- scientific article; zbMATH DE number 5656462 (Why is no real title available?)
- scientific article; zbMATH DE number 2121251 (Why is no real title available?)
- scientific article; zbMATH DE number 2239308 (Why is no real title available?)
- Comparing Zagreb \(M1\) and \(M2\) indices for acyclic molecules
- Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees
- Comparing variable Zagreb \(M_1\) and \(M_2\) indices for acyclic molecules
- Comparing variable Zagreb indices for unicyclic graphs
- Sharp bounds for the second Zagreb index of unicyclic graphs
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
Cited in
(10)- On a novel eccentricity-based invariant of a graph
- scientific article; zbMATH DE number 5656462 (Why is no real title available?)
- On the first geometric-arithmetic index of graphs
- scientific article; zbMATH DE number 7411417 (Why is no real title available?)
- scientific article; zbMATH DE number 7427121 (Why is no real title available?)
- On a conjecture about the second Zagreb index
- Complete characterization of graphs for direct comparing Zagreb indices
- On comparing Zagreb indices
- Maximum Zagreb indices in the class of \(k\)-apex trees
- Comparing Zagreb indices for almost all graphs
This page was built for publication: Comparing Zagreb indices for connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708341)