Extremal symmetric division deg index of molecular trees and molecular graphs with fixed number of pendant vertices
From MaRDI portal
Publication:2168591
Recommendations
- On the symmetric division deg index of molecular graphs
- Symmetric Division Deg Index: Extremal Results and Bounds
- Graphs that minimizing symmetric division deg index
- Upper bounds for symmetric division deg index of graphs
- On symmetric division deg index of unicyclic graphs and bicyclic graphs with given matching number
Cites work
- A formula with its applications on the difference of Zagreb indices of graphs
- Bounds for symmetric division deg index of graphs
- Graph operations on the symmetric division deg index of graphs
- Graph theory with applications
- Graphs that minimizing symmetric division deg index
- New results on symmetric division deg index
- On symmetric division deg index of trees with given parameters
- On symmetric division deg index of unicyclic graphs and bicyclic graphs with given matching number
- On the reduced second Zagreb index of graphs
- On the symmetric division deg index of graph
- On the symmetric division deg index of molecular graphs
- Some extremal graphs with respect to inverse degree
- Sum-connectivity index of molecular trees
- Upper and lower bounds of symmetric division deg index
Cited in
(4)- Symmetric Division Deg Index: Extremal Results and Bounds
- On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves
- scientific article; zbMATH DE number 7723580 (Why is no real title available?)
- On symmetric division deg index of unicyclic graphs and bicyclic graphs with given matching number
This page was built for publication: Extremal symmetric division deg index of molecular trees and molecular graphs with fixed number of pendant vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168591)