Maximum second Zagreb index of trees with given Roman domination number
From MaRDI portal
Publication:5045984
Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Recommendations
- On extremal Zagreb indices of trees with given domination number
- On extremal multiplicative Zagreb indices of trees with given domination number
- Further properties of the second Zagreb index
- On multiplicative sum Zagreb index of trees with fixed domination number
- scientific article; zbMATH DE number 6664769
Cites work
- scientific article; zbMATH DE number 6813626 (Why is no real title available?)
- scientific article; zbMATH DE number 2121251 (Why is no real title available?)
- scientific article; zbMATH DE number 6298616 (Why is no real title available?)
- A characterization of Roman trees
- Average distance and domination number
- Bounds for Zagreb indices
- On extremal Zagreb indices of trees with given domination number
- On the Roman domination number of a graph
- On the Roman domination subdivision number of a graph
- Roman domination in graphs.
- Sharp bounds for the second Zagreb index of unicyclic graphs
- The Zagreb indices of graphs with a given clique number
- The second Zagreb indices of graphs with given degree sequences
- Total domination in graphs
Cited in
(2)
This page was built for publication: Maximum second Zagreb index of trees with given Roman domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045984)
