On a Conjecture about Degree Deviation Measure of Graphs
From MaRDI portal
Abstract: Let G be an n-vertex graph with m edges. The degree deviation measure of G is defined as s(G)=sum v in V(G)|degG(v)-(2m/n)|, where n and m are the number of vertices and edges of G, respectively. The aim of this paper is to prove the Conjecture 4.2 of [J A de Oliveira, C S Oliveira, C Justel and N M Maia de Abreu, Measures of irregularity of graphs, Pesq. Oper. 33 (3) (2013) 383-398]. The degree deviation measure of chemical graphs under some conditions on the cyclomatic number is also computed.
Recommendations
- On the upper bounds for the degree deviation of graphs
- A note on spectral radius and degree deviation in graphs
- scientific article; zbMATH DE number 1751594
- On the degree distance of a graph
- Further properties on the degree distance of graphs
- On the general degree-eccentricity index of a graph
- Some extremal properties of the degree distance of a graph
- Some extremal properties of the degree distance of a graph
- On ve-degrees and ev-degrees in graphs
- The degree distance of certain particular graphs
Cites work
- Eigenvalues and degree deviation in graphs
- Extremal graphs for the second multiplicative Zagreb index
- scientific article; zbMATH DE number 1409213 (Why is no real title available?)
- scientific article; zbMATH DE number 7090166
- On the upper bounds for the degree deviation of graphs
- The total irregularity of a graph
Cited in
(4)
This page was built for publication: On a Conjecture about Degree Deviation Measure of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4997224)