On the discrepancy between two Zagreb indices

DOI10.1016/J.DISC.2018.06.009zbMATH Open1392.05028arXiv1801.02532OpenAlexW2963786781WikidataQ129609185 ScholiaQ129609185MaRDI QIDQ724879FDOQ724879

Authors: Ashwin Sah, Mehtaab Sawhney 

Publication date: 26 July 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We examine the quantity [S(G) = sum_{uvin E(G)} min( ext{deg } u, ext{deg } v)] over sets of graphs with a fixed number of edges. The main result shows the maximum possible value of $S(G)$ is achieved by three different classes of constructions, depending on the distance between the number of edges and the nearest triangular number. Furthermore we determine the maximum possible value when the set of graphs is restricted to be bipartite, a forest or to be planar given sufficiently many edges. The quantity $S(G)$ corresponds to the difference between two well studied indices, the irregularity of a graph and the sum of the squares of the degrees in a graph. These are known as the first and third Zagreb indices in the area of mathematical chemistry.

Full work available at URL: https://arxiv.org/abs/1801.02532

Recommendations

• On Zagreb indices of graphs
• Further properties of the second Zagreb index
• On comparing Zagreb indices of graphs
• On the Zagreb indices equality
• Further properties of Zagreb indices

zbMATH Keywords

Zagreb indices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Cites Work

• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Maximizing the sum of the squares of the degrees of a graph
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A remark on the existence of finite graphs
• Graphs with maximal number of adjacent pairs of edges
• Old and new Zagreb indices of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on Zagreb indices
• An upper bound on the sum of squares of degrees in a graph
• The sum of the squares of degrees: sharp asymptotics
• Sum of squares of degrees in a graph
• Extreme values of the sum of squares of degrees of bipartite graphs
• Zagreb indices of graphs
• Remarks on Zagreb indices
• On the irregularity of bipartite graphs
• Rearrangements of \((0,-1)\) matrices
• The irregularity of two types of trees
• Graphs with maximal irregularity
• Title not available (Why is that?)
• On the irregularity of trees and unicyclic graphs with given matching number
• On Planar Graphical Degree Sequences
• Extremely irregular graphs

Cited In (3)

• Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices
• On the difference of Mostar index and irregularity of graphs
• On the extremal cacti of given parameters with respect to the difference of Zagreb indices

Uses Software

• MathOverflow

This page was built for publication: On the discrepancy between two Zagreb indices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724879)