The Bounds for the First General Zagreb Index of a Graph
The first general Zagreb index of a graph $G$ is defined as the sum of the $\alpha$th powers of the vertex degrees of $G$, where $\alpha$ is a real number such that $\alpha \neq 0$ and $\alpha \neq 1$. In this note, for $\alpha > 1$, we present upper bounds involving chromatic and clique numb...
Main Author: | Rao Li |
---|---|
Format: | Article |
Language: | English |
Published: |
Emrah Evren KARA
2021-12-01
|
Series: | Universal Journal of Mathematics and Applications |
Subjects: | |
Online Access: | https://dergipark.org.tr/tr/download/article-file/1888936 |
Similar Items
-
General multiplicative Zagreb indices of graphs with given clique number
by: Tomáš Vetrík, et al.
Published: (2019-01-01) -
On General Reduced Second Zagreb Index of Graphs
by: Lkhagva Buyantogtokh, et al.
Published: (2022-09-01) -
Some Extremal Graphs with Respect to Sombor Index
by: Kinkar Chandra Das, et al.
Published: (2021-05-01) -
Maximal first Zagreb index of trees with given Roman domination number
by: Zhibin Du, et al.
Published: (2022-04-01) -
Chromatic and clique numbers of a class of perfect graphs
by: Mohammad Reza Fander
Published: (2015-12-01)