2020
DOI: 10.1142/s179355712150087x
|View full text |Cite
|
Sign up to set email alerts
|

Extremal multiplicative Zagreb indices among trees with given distance k-domination number

Abstract: The first multiplicative Zagreb index [Formula: see text] of a graph [Formula: see text] is the product of the square of every vertex degree, while the second multiplicative Zagreb index [Formula: see text] is the product of the products of degrees of pairs of adjacent vertices. In this paper, we give sharp lower bound for [Formula: see text] and upper bound for [Formula: see text] of trees with given distance [Formula: see text]-domination number, and characterize those trees attaining the bounds.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…It means that condition 8 is not true, and it will be the optimal choice of the quantities x i � 0 for δ + 1 ≤ i ≤ Δ − 1 such that x t � 1 (except for i � t). erefore, we can conclude from (17) that…”
Section: Proof Consider X I As the Number Of Vertices Of Degree I In Gmentioning
confidence: 86%
See 1 more Smart Citation
“…It means that condition 8 is not true, and it will be the optimal choice of the quantities x i � 0 for δ + 1 ≤ i ≤ Δ − 1 such that x t � 1 (except for i � t). erefore, we can conclude from (17) that…”
Section: Proof Consider X I As the Number Of Vertices Of Degree I In Gmentioning
confidence: 86%
“…Finally, Section 5 presents the conclusions of the obtained results. To know more related to this field, readers are referred to [12][13][14][15][16][17].…”
Section: Introductionmentioning
confidence: 99%