Abstract
Recently, Furtula et al. [B. Furtula, I. Gutman, S. Ediz, On difference of Zagreb indices, Discrete Appl. Math., 2014] introduced a new vertex-degree-based graph invariant "reduced second Zagreb index" in chemical graph theory. Here we generalize the reduced second Zagreb index (call "general reduced second Zagreb index"), denoted by GRMα(G) and is defined as: GRMα(G) = ∑ uv∈E(G)(dG(u) + α)(dG(v) + α), where α is any real number and dG(v) is the degree of the vertex v of G. Let Gk n be the set of connected graphs of order n with k cut edges. In this paper, we study some properties of GRMα(G) for connected graphs G. Moreover, we obtain the sharp upper bounds on GRMα(G) in Gk n for α ≥ −1/2 and characterize the extremal graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 1046-1056 |
| Number of pages | 11 |
| Journal | Hacettepe Journal of Mathematics and Statistics |
| Volume | 48 |
| Issue number | 4 |
| DOIs | |
| State | Published - 2019 |
Keywords
- Connected graph
- Cut edge
- General reduced second Zagreb index
- Maximum degree
- Zagreb indices
Fingerprint
Dive into the research topics of 'On general reduced second Zagreb index of graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver