Comparing the Zagreb indices of the NEPS of graphs
From MaRDI portal
Publication:2449219
Recommendations
Cites work
- scientific article; zbMATH DE number 5656462 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 2121251 (Why is no real title available?)
- A survey on comparing Zagreb indices
- Comparing Zagreb \(M1\) and \(M2\) indices for acyclic molecules
- Old and new Zagreb indices of graphs
- On comparing Zagreb indices
- On the Zagreb index inequality of graphs with prescribed vertex degrees
- On the Zagreb indices of the line graphs of the subdivision graphs
- On the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most \(k\)
- Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
- The Zagreb indices of graphs with a given clique number
- The first and second Zagreb indices of some graph operations
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
Cited in
(5)- scientific article; zbMATH DE number 5656462 (Why is no real title available?)
- Extremal tetracyclic graphs with respect to the first and second Zagreb indices
- A bound on the spectral radius of graphs in terms of their Zagreb indices
- scientific article; zbMATH DE number 7427121 (Why is no real title available?)
- On eccentric connectivity index of eccentric graph of regular dendrimer
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)