A study on total irregularities of certain graphs and digraphs

Abstract : The total irregularity of a simple undirected graph G is denoted by irr t (G) and is defined as irr t (G) = 1 2 ∑ u,v∈V(G) �d(u) − d(v)�. In this paper, we introduce the notion of edge-transformation in relation to total irregularity of simple graphs with at least one cut edge as well as an edge-joint between two graphs. We also introduce the notion of total irregularity with respect to in-degree and out-degree in directed graphs. We also introduce the concept of total irregularity in respect of in-degree and out-degree in simple directed graphs. These invariants are called total in-irregularity and total out-irregularity, respectively. In this paper, we initiate a study on these parameters of given simple undirected graphs and simple digraphs.
Document type :
Journal articles
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

Contributor : Sudev Naduvath <>
Submitted on : Sunday, August 4, 2019 - 5:34:19 AM
Last modification on : Tuesday, August 6, 2019 - 1:01:23 AM


3. A study on total irregulari...
Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License




Johan Kok, Sudev Naduvath. A study on total irregularities of certain graphs and digraphs. Cogent Mathematics & Statistics, Taylor & Francis, 2016, 3 (1), ⟨10.1080/23311835.2016.1179708⟩. ⟨hal-02263315⟩



Record views


Files downloads