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

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 94143-94149 ◽  
Author(s):  
Doost Ali Mojdeh ◽  
Mohammad Habibi ◽  
Leila Badakhshian ◽  
Yongsheng Rao
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Jianxin Wei ◽  
Uzma Ahmad ◽  
Saira Hameed ◽  
Javaria Hanif

For a connected graph J, a subset W ⊆ V J is termed as a locating-total dominating set if for a ∈ V J ,   N a ∩ W ≠ ϕ , and for a ,   b ∈ V J − W ,   N a ∩ W ≠ N b ∩ W . The number of elements in a smallest such subset is termed as the locating-total domination number of J. In this paper, the locating-total domination number of unicyclic graphs and bicyclic graphs are studied and their bounds are presented. Then, by using these bounds, an upper bound for cacti graphs in terms of their order and number of cycles is estimated. Moreover, the exact values of this domination variant for some families of cacti graphs including tadpole graphs and rooted products are also determined.


2017 ◽  
Vol 2017 ◽  
pp. 1-5 ◽  
Author(s):  
Wei Gao ◽  
Muhammad Kamran Jamil ◽  
Aisha Javed ◽  
Mohammad Reza Farahani ◽  
Shaohui Wang ◽  
...  

The hyper-Zagreb index is an important branch in the Zagreb indices family, which is defined as∑uv∈E(G)‍(d(u)+d(v))2, whered(v)is the degree of the vertexvin a graphG=(V(G),E(G)). In this paper, the monotonicity of the hyper-Zagreb index under some graph transformations was studied. Using these nice mathematical properties, the extremal graphs amongn-vertex trees (acyclic), unicyclic, and bicyclic graphs are determined for hyper-Zagreb index. Furthermore, the sharp upper and lower bounds on the hyper-Zagreb index of these graphs are provided.


Author(s):  
Aisha Javed ◽  
Muhammad Kamran Jamil ◽  
Jia-Bao Liu ◽  
Akbar Ali

Background:: A topological index of a molecular graph is the numeric quantity which can predict certain physical and chemical properties of the corresponding molecule. Xu et al. introduced some graph transformations which increase or decrease the first and second multiplicative Zagreb indices and proposed a unified approach to characterize extremal (n, m)- graphs. Method:: Graph transformations are used to find the extremal graphs, these transformations either increase or decrease the general multiplicative Zagreb indices. By applying the transformations which increase the general multiplicative Zagreb indices we find the graphs with maximal general multiplicative Zagreb indices and for minimal general Zagreb indices we use the transformations which decrease the index. Result:: In this paper, we extend the Xu’s results and show that the same graph transformations increase or decrease the first and second general multiplicative Zagreb indices for . As an application, the extremal acyclic, unicyclic and bicyclic graphs are presented for general multiplicative Zagreb indices. Conclusion:: By applying the transformation we investigated that in the class of acyclic, unicyclic and bicyclic graphs, which graph gives the minimum and the maximum general multiplicative Zagreb indices.


Symmetry ◽  
2020 ◽  
Vol 12 (4) ◽  
pp. 514 ◽  
Author(s):  
Monther R. Alfuraidan ◽  
Tomáš Vetrík ◽  
Selvaraj Balachandran

We present lower and upper bounds on the general multiplicative Zagreb indices for bicyclic graphs of a given order and number of pendant vertices. Then, we generalize our methods and obtain bounds for the general multiplicative Zagreb indices of tricyclic graphs, tetracyclic graphs and graphs of given order, size and number of pendant vertices. We show that all our bounds are sharp by presenting extremal graphs including graphs with symmetries. Bounds for the classical multiplicative Zagreb indices are special cases of our results.


Networks ◽  
2021 ◽  
Author(s):  
Maimoonah Ahmed ◽  
Ben Cameron
Keyword(s):  

2020 ◽  
Author(s):  
M. Radhakrishnan ◽  
M. Suresh ◽  
V. Mohana Selvi

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 43
Author(s):  
José M. Sigarreta

A topic of current interest in the study of topological indices is to find relations between some index and one or several relevant parameters and/or other indices. In this paper we study two general topological indices Aα and Bα, defined for each graph H=(V(H),E(H)) by Aα(H)=∑ij∈E(H)f(di,dj)α and Bα(H)=∑i∈V(H)h(di)α, where di denotes the degree of the vertex i and α is any real number. Many important topological indices can be obtained from Aα and Bα by choosing appropriate symmetric functions and values of α. This new framework provides new tools that allow to obtain in a unified way inequalities involving many different topological indices. In particular, we obtain new optimal bounds on the variable Zagreb indices, the variable sum-connectivity index, the variable geometric-arithmetic index and the variable inverse sum indeg index. Thus, our approach provides both new tools for the study of topological indices and new bounds for a large class of topological indices. We obtain several optimal bounds of Aα (respectively, Bα) involving Aβ (respectively, Bβ). Moreover, we provide several bounds of the variable geometric-arithmetic index in terms of the variable inverse sum indeg index, and two bounds of the variable inverse sum indeg index in terms of the variable second Zagreb and the variable sum-connectivity indices.


Sign in / Sign up

Export Citation Format

Share Document