Maximal first Zagreb index of trees with given Roman domination number-Reference-Cited by-同舟云学术

Maximal first Zagreb index of trees with given Roman domination number

Published:2022 Issue:7 Volume:7 Page:11801-11812
ISSN:2473-6988
Container-title:AIMS Mathematics
language:
Short-container-title:MATH

Author:

Du Zhibin¹,Jamri Ayu Ameliatul Shahilah Ahmad²,Hasni Roslan²,Mojdeh Doost Ali³

Affiliation:

1. School of Software, South China Normal University, Foshan, Guangdong, China

2. Special Interest Group on Modeling and Data Analytics, Faculty of Ocean Engineering Technology and Informatics, Universiti Malaysia Terengganu, Kuala Nerus 21030, Terengganu, Malaysia

3. Department of Mathematics, Faculty of Mathematical Sciences, University of Mazandaran, Babolsar, Iran

Abstract

<abstract><p>The first Zagreb index of graphs is defined to be the sum of squares of degrees of all the vertices of graphs. It drew a great deal of attention in the past half-century. In this paper, we study the relationship between the first Zagreb index and Roman domination number of graphs. More precisely, we characterize the trees with the maximum first Zagreb index among trees with given Roman domination number.</p></abstract>

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

General Mathematics

Reference24 articles.

1. H. A. Ahangar, M. Khaibari, Graphs with large Roman domination number, Malaysian J. Math. Sci., 11 (2017), 71–81.

2. A. Alhashim, W. J. Desormeaux, T. W. Haynes, Roman domination in complementary prisms, Australas. J. Comb., 68 (2017), 218–228.

3. J. Amjadi, R. Khoeilar, M. Chellali, Z. Shao, On the Roman domination subdivision number of a graph, J. Comb. Optim., 40 (2020), 501–511. https://doi.org/10.1007/s10878-020-00597-x

4. S. Bermudo, J. E. Nápoles, J. Rada, Extremal trees for the Randić index with given domination number, Appl. Math. Comput., 375 (2020), 125122. https://doi.org/10.1016/j.amc.2020.125122

5. B. Borovićanin, K. C. Das, B. Furtula, I. Gutman, Bounds for Zagreb indices, MATCH Commun. Math. Comput. Chem., 78 (2017), 17–100.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Some sufficient conditions for a tree to have its weak Roman domination number be equal to its domination number plus 1;AIMS Mathematics;2023