In 2012, Abdo and Dimitrov defined the total irregularity of a graph G=(V,E) as irrtG=1/2∑u,v∈VdGu-dGv, where dGu denotes the vertex degree of a vertex u∈V. In this paper, we investigate the total irregularity of bicyclic graphs and characterize the graph with the maximal total irregularity among all bicyclic graphs on n vertices
AbstractDenote by λ1(G) the largest eigenvalue of a real (0, 1)-adjacency matrix of a graph G, and b...
The total irregularity of a simple undirected graph G is denoted by $ irr_t(G) $ and is defined as $...
Many networks have been found the total edge irregularity strength???s. In this paper, we found that...
In this note a new measure of irregularity of a graph G is introduced. It is named the total irregul...
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 ...
AbstractThe imbalance of an edge uv in a graph G is defined as |d(u)-d(v)|, where d(u) denotes the d...
summary:The irregularity of a graph $G=(V, E)$ is defined as the sum of imbalances $|d_u-d_v|$ over ...
AbstractA totally irregular total k-labeling λ: V ∪ E → {1, 2, · · ·, k} of a graph G is a total lab...
An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of ver...
AbstractWe investigate the following modification of the well-known irregularity strength of graphs....
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |d...
AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges o...
AbstractLet G = (V, E) be a simple and undirected graph with a vertex set V and an edge set E. A tot...
For a graph G(V,E), the support s(v) of a vertex v is defined as the sum of degrees of its neighbour...
AbstractDenote by λ1(G) the largest eigenvalue of a real (0, 1)-adjacency matrix of a graph G, and b...
The total irregularity of a simple undirected graph G is denoted by $ irr_t(G) $ and is defined as $...
Many networks have been found the total edge irregularity strength???s. In this paper, we found that...
In this note a new measure of irregularity of a graph G is introduced. It is named the total irregul...
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 ...
AbstractThe imbalance of an edge uv in a graph G is defined as |d(u)-d(v)|, where d(u) denotes the d...
summary:The irregularity of a graph $G=(V, E)$ is defined as the sum of imbalances $|d_u-d_v|$ over ...
AbstractA totally irregular total k-labeling λ: V ∪ E → {1, 2, · · ·, k} of a graph G is a total lab...
An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of ver...
AbstractWe investigate the following modification of the well-known irregularity strength of graphs....
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |d...
AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges o...
AbstractLet G = (V, E) be a simple and undirected graph with a vertex set V and an edge set E. A tot...
For a graph G(V,E), the support s(v) of a vertex v is defined as the sum of degrees of its neighbour...
AbstractDenote by λ1(G) the largest eigenvalue of a real (0, 1)-adjacency matrix of a graph G, and b...
The total irregularity of a simple undirected graph G is denoted by $ irr_t(G) $ and is defined as $...
Many networks have been found the total edge irregularity strength???s. In this paper, we found that...
DOI
Add to ORKG