Zagreb Indices of Trees, Unicyclic and Bicyclic Graphs With Given (Total) Domination

Doost Ali Mojdeh, Mohammad Habibi, Leila Badakhshian, Yongsheng Rao

IEEE Access · 2019 · 19 citations · 9 references

DOIFull text

Open access

Concepts

Abstract

Let G = (V, E) be a (molecular) graph. For a family of graphs G, the first Zagreb index M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> and the second Zagreb index M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> have already studied. In particular, it has been presented, the first Zagreb index M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> and the second Zagreb index M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> of trees T in terms of domination parameter. In this paper, we present upper bounds on Zagreb indices of unicyclic and bicyclic graphs with a given domination number and also find upper bounds on the Zagreb indices of trees, unicyclic, and bicyclic graphs with a given total domination number.

References

9