Comparing Zagreb indices for connected graphs
From MaRDI portal
Publication:708341
DOI10.1016/J.DAM.2010.02.013zbMATH Open1230.05188OpenAlexW1980089456MaRDI QIDQ708341FDOQ708341
Batmend Horoldagva, Sang-Gu Lee
Publication date: 11 October 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.02.013
Recommendations
Cites Work
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Title not available (Why is that?)
- Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees
- Sharp bounds for the second Zagreb index of unicyclic graphs
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Title not available (Why is that?)
- Comparing variable Zagreb \(M_1\) and \(M_2\) indices for acyclic molecules
- Title not available (Why is that?)
- Comparing variable Zagreb indices for unicyclic graphs
Cited In (7)
- On a novel eccentricity-based invariant of a graph
- Title not available (Why is that?)
- On the first geometric-arithmetic index of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- MAXIMUM ZAGREB INDICES IN THE CLASS OF k-APEX TREES
- Complete characterization of graphs for direct comparing Zagreb indices
Uses Software
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)
