Reformulated F-index of graph operations
From MaRDI portal
Recommendations
- F-index of some graph operations
- Reformulated first Zagreb index of some graph operations
- The modified Schultz index of graph operations
- A note on revised Szeged index of graph operations
- F index of graphs based on four new operations related to the strong product
- Reformulated Zagreb indices of vertex F-join graphs
- The modified Wiener index of some graph operations
- The hyper-Wiener index of graph operations
- Kirchhoff index of graphs and some graph operations
- Reformulated reciprocal degree distance of graph operations
Cited in
(18)- The changes in indices of modified graphs
- New results on the geometric-arithmetic index
- New bounds for the Randić index of graphs
- Upper bounds for the forgotten topological index of graphs with given domination number
- Sharp upper bounds of the \(F\)-index of unicyclic graphs
- Reformulated Zagreb indices of vertex F-join graphs
- Bounds of redefined Zagreb indices for \(\mathrm{F}\)-sum of graphs, \(F=S\) or \(R\).
- F index of graphs based on four new operations related to the strong product
- Beyond the Zagreb indices
- Sharp bounds on the augmented Zagreb index of graph operations
- A novel graph invariant: The third leap Zagreb index under several graph operations
- Sharp upper bounds of F-index among bicyclic graphs
- Inverse Problem for the Forgotten and the Hyper Zagreb Indices of Trees
- ONTRANSFORMEDGRAPHS
- Expected value for the k-distance degree index of a graph
- On the topological indices and graph operation
- Maximal first Zagreb connection index of trees with given total domination number
- Reformulated first Zagreb index of some graph operations
This page was built for publication: Reformulated F-index of graph operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598308)
