Indexed metadata

The total irregularity of a graph

Hosam Abdo, Stephan Brandt, D. Dimitrov

Source record

Source: Crossref

Published: Apr 4, 2014

DOI: 10.46298/dmtcs.1263

Open original source ↗

Source abstract

Graph Theory In this note a new measure of irregularity of a graph G is introduced. It is named the total irregularity of a graph and is defined as irr(t)(G) - 1/2 Sigma(u, v is an element of V(G)) vertical bar d(G)(u) - d(G)(v)vertical bar, where d(G)(u) denotes the degree of a vertex u is an element of V(G). All graphs with maximal total irregularity are determined. It is also shown that among all trees of the same order the star has the maximal total irregularity.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

The total irregularity of a graph — Mathematical Frontier Network