A lower bound for the second Zagreb index of trees with given Roman domination number
From MaRDI portal
Publication:6159871
DOI10.22049/CCO.2022.27553.1288zbMATH Open1524.05039MaRDI QIDQ6159871FDOQ6159871
Authors: Jamri Ayu Ameliatul Shahilah Ahmad, Fateme Movahedi, Roslan Hasni, Mohammad Hadi Akhbari
Publication date: 23 June 2023
Recommendations
- On the Zagreb indices of graphs with given Roman domination number
- Maximum second Zagreb index of trees with given Roman domination number
- Roman domination and 2-independence in trees
- A characterization of Roman trees
- A characterization of trees with equal Roman 2-domination and Roman domination numbers
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)
Cites Work
- Roman domination in graphs.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Roman domination in graphs
- Average distance and domination number
- On extremal Zagreb indices of trees with given domination number
- Bounds for Zagreb indices
- Topics in Domination in Graphs
- On the Zagreb indices of graphs with given Roman domination number
Cited In (3)
This page was built for publication: A lower bound for the 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 Q6159871)