On the Zagreb index inequality of graphs with prescribed vertex degrees
From MaRDI portal
Publication:534355
DOI10.1016/J.DAM.2011.01.002zbMATH Open1222.05028OpenAlexW1989405910MaRDI QIDQ534355FDOQ534355
Sašo Bogoev, Darko Dimitrov, Riste Škrekovski, Vesna Andova, Marcin Pilipczuk
Publication date: 17 May 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.01.002
Recommendations
Cites Work
- Title not available (Why is that?)
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on Zagreb indices
- On comparing Zagreb indices
- Title not available (Why is that?)
- Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees
- Title not available (Why is that?)
Cited In (11)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A formula with its applications on the difference of Zagreb indices of graphs
- The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs
- Phase Changes in the Topological Indices of Scale-Free Trees
- The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs
- Bounds for degree-sum adjacency eigenvalues of a graph in terms of Zagreb indices
- On the Zagreb indices equality
- On difference of Zagreb indices
- Comparing the Zagreb indices of the NEPS of graphs
- Title not available (Why is that?)
Uses Software
This page was built for publication: On the Zagreb index inequality of graphs with prescribed vertex degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534355)
