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 irrt(G) = 1 / 2∑u,v ∈V(G) |dG(u)-dG(v)|, where dG(u) denotes the degree of a vertex u ∈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
AbstractTwo new graph characteristics, the total vertex irregularity strength and the total edge irr...
ABSTRACT. A graph is regular if every vertex is of the same degree. Otherwise, it is an irregular gr...
Two new graph characteristics, the total vertex irregularity strength and the total edge irregularit...
In this note a new measure of irregularity of a graph G is introduced. It is named the total irregul...
AbstractDenote by λ1(G) the largest eigenvalue of a real (0, 1)-adjacency matrix of a graph G, and b...
In 2012, Abdo and Dimitrov defined the total irregularity of a graph G=(V,E) as irrtG=1/2∑u,v∈VdGu-d...
International audienceAlbertson~\cite{Albertson} has defined the {\em irregularity} of a simple, und...
Let G be a connected graph with maximum degree ?(G). The irregularity index t(G) of G is defined as ...
A graph is regular if every vertex is of the same degree. Otherwise, it is an irregular graph. Altho...
International audienceThe total irregularity of a simple undirected graph G is denoted by irr t (G) ...
AbstractMotivated by the notion of the irregularity strength of a graph introduced by Chartrand et a...
AbstractA vertex irregular total k-labelling λ:V(G)∪E(G)⟶{1,2,…,k} of a graph G is a labelling of ve...
summary:The irregularity of a graph $G=(V, E)$ is defined as the sum of imbalances $|d_u-d_v|$ over ...
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |d...
In this paper, we define and compare three new measures of graph irregularity. We use these measures...
AbstractTwo new graph characteristics, the total vertex irregularity strength and the total edge irr...
ABSTRACT. A graph is regular if every vertex is of the same degree. Otherwise, it is an irregular gr...
Two new graph characteristics, the total vertex irregularity strength and the total edge irregularit...
In this note a new measure of irregularity of a graph G is introduced. It is named the total irregul...
AbstractDenote by λ1(G) the largest eigenvalue of a real (0, 1)-adjacency matrix of a graph G, and b...
In 2012, Abdo and Dimitrov defined the total irregularity of a graph G=(V,E) as irrtG=1/2∑u,v∈VdGu-d...
International audienceAlbertson~\cite{Albertson} has defined the {\em irregularity} of a simple, und...
Let G be a connected graph with maximum degree ?(G). The irregularity index t(G) of G is defined as ...
A graph is regular if every vertex is of the same degree. Otherwise, it is an irregular graph. Altho...
International audienceThe total irregularity of a simple undirected graph G is denoted by irr t (G) ...
AbstractMotivated by the notion of the irregularity strength of a graph introduced by Chartrand et a...
AbstractA vertex irregular total k-labelling λ:V(G)∪E(G)⟶{1,2,…,k} of a graph G is a labelling of ve...
summary:The irregularity of a graph $G=(V, E)$ is defined as the sum of imbalances $|d_u-d_v|$ over ...
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |d...
In this paper, we define and compare three new measures of graph irregularity. We use these measures...
AbstractTwo new graph characteristics, the total vertex irregularity strength and the total edge irr...
ABSTRACT. A graph is regular if every vertex is of the same degree. Otherwise, it is an irregular gr...
Two new graph characteristics, the total vertex irregularity strength and the total edge irregularit...
DOI
Add to ORKG