Comparing the Zagreb indices of the NEPS of graphs
From MaRDI portal
Publication:2449219
DOI10.1016/J.AMC.2012.07.014zbMATH Open1287.05025OpenAlexW2001337009MaRDI QIDQ2449219FDOQ2449219
Authors: Dragan Stevanović 
Publication date: 7 May 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.07.014
Recommendations
Cartesian product of graphsfirst Zagreb indexsecond Zagreb indexdirect product of graphsNEPS of graphsHansen-Vukičević conjecture
Cites Work
- Title not available (Why is that?)
- The first and second Zagreb indices of some graph operations
- On the Zagreb indices of the line graphs of the subdivision graphs
- Title not available (Why is that?)
- Old and new Zagreb indices of graphs
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- The Zagreb indices of graphs with a given clique number
- A survey on comparing Zagreb indices
- On comparing Zagreb indices
- Comparing Zagreb \(M1\) and \(M2\) indices for acyclic molecules
- On the Zagreb index inequality of graphs with prescribed vertex degrees
- Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
- On the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most \(k\)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Comparing the Zagreb indices of the NEPS of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449219)
