A study on total irregularities of certain graphs and digraphs

The total irregularity of a simple undirected graph G is denoted by irr t (G) and is defined as irr t (G) = 1


Introduction
For general notations and concepts in graph theory, we refer to Bondy and Murty (1976), Harary (1969), West (2001) and for digraph theory, we further refer to Chartrand and Lesniak (2000), Jensen ABOUT THE AUTHORS Johan Kok is registered with the South African Council for Natural Scientific Professions (South Africa) as a professional scientists in both Physical Science and Mathematical Science. His main research areas are in Graph Theory and the reconstruction of motor vehicle collisions. He has been endorsed by international peers as skilled in a wide range of combinatorica disciplines. Johan has a keen interest in mathematics education as well.
Naduvath Sudev has been working as a professor (Associate) in the Department of Mathematics, Vidya Academy of Science and Technology, Thrissur, India, for the last 15 years. His primary research areas are Graph Theory and Combinatorics. He is a reviewer of Mathematical Reviews and Zentralblatt MATH and reviewer of more than 15 journals. He has more than 40 publications in different international journals.

PUBLIC INTEREST STATEMENT
Major real world applications of irregularities of graphs are in chemical graph theory, biological and economical systems. Results stemming from operations between graphs or structurally changing a graph, are enhanced through this study related to branch-transformation and the introduction of an edge joint. The immediate application of edge-joint is to gain an understanding of stringing of graphs and many biological structures can be modelled as graphs stringed sequentially. With regards to directed graphs the field of study is wide open. Directed graphs allow the analysis of the influence a vertex (the tail) has over a neighbour (the head). Applications lies in the initial modelling of directed graphs as null-graphs with vertices carrying floating out-arcs seeking heads. A vertex with zero floating out-arcs can only be a head of one or more vertices, hence resembles a black hole in cosmic space. Modelling cosmic systems as null-graphs with vertices carrying floating out-arcs seeking heads is regarded as a promising new application.
and Gutin (2007). All graphs mentioned in this paper are simple, connected and finite graphs, unless mentioned otherwise. Also, except for Section 4, all the graphs mentioned here are undirected graphs.
A graph G is said to be regular if the degree of all vertices are equal. A graph that is not regular is called an irregular graph. The total irregularity of a given simple connected graph is defined in Albertson (1997) as follows.
Definition 1.1 (Albertson, 1997) The imbalance of an edge e = uv in a given graph G is defined as |d(u) − d(v)|. The total irregularity of a graph G, denoted by irr t (G), is defined as If the vertices of a graph G on n vertices are labelled as v i , i = 1, 2, 3, … , n, then the definition graph on a singular vertex (1-null graph or K 1 ), we define irr t (G) = 0. Clearly, irr t (G) = 0 if and only if G is regular.
If an edge e is a cut-edge of the graph G and a component of G − e is a tree T, then T is called a hanging tree of G. The notion of branch-transformation of a graph has been introduced in Zhu, You, and Yang (in press) as follows.
Definition 1.2 (Zhu et al., in press) Let G be a graph with at least two pendant vertices. Without loss of generality, let u be a vertex of G with d G (u) ≥ 3, T be a hanging tree of G connecting to u with |V(T)| ≥ 1 and v be a pendant vertex of G with v ∉ T. Let G ′ be the graph obtained from G by deleting T from vertex u and attaching it to vertex v. We call the transformation from G to G ′ a branch-transformation on G from vertex u to vertex v.
Certain studies on irregularities and total irregularities of given graphs and the properties graphs related to these irregularities have been done in Abdo, Brandt, and Dimitrov (2014), Abdo, Cohen, and Dimitrov (in press), , Albertson (1997), Dimitrov and Škrekovski (2015), Henning and Rautenbach (2007), Zhu et al. (in press). There are many specific results in respect of cut vertices and cut-edges in the studies on various concepts in graph theory. Many applications rely on either the existence of cut-vertices or cut edges as well. Where stringing of graphs is required through linking graphs pairwise through adding a single edges between pairs of vertices, multiple cut-edges exist in the resultant stringed graph. The order of stringing may, in some instances, not obey the commutative property with respect to certain invariants. For directed graphs, orientated stringing is generally more complex and may require extremal graph theoretic analysis.
Motivated from these observations, 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 and initiate a study on certain types of total irregularities of given classes of directed and undirected graphs.

Total irregularity resulting from edge-joints
Consider a graph G on n vertices with two connected components G 1 and G 2 . Therefore, G = G 1 ∪ G 2 .
The concept of an edge-joint between two simple undirected graphs G and H is defined below.

Definition 2.1
The edge-joint of two graphs G and H is the graph obtained by adding one edge, say uv, where u ∈ V(G), v ∈ V(H), and is denoted by G ⇝ uv H.
Let G be a graph on n vertices with two connected components G 1 and G 2 whose vertex sets are V(G 1 ) = {u i :1 ≤ i ≤ r} and V(G 2 ) = {v j :1 ≤ j ≤ s}. We fix the vertices u 1 from G 1 and v 1 from G 2 .
Similarly, let

Theorem 2.3 Let G be a graph on n vertices with two connected components
actly (a − 1). It also reduces the partial sum � by exactly a * and decreases the partial sum . It also reduces the partial sum by exactly c * and decreases the partial sum Hence, we have an interim result as follows.
By substituting the variables b, d, b * and d * as defined in Definition the final result is as follows.
Clearly irr t (G � ) is edge dependent in general but we have the following Corollary.
Proof Begin the proof by choosing any vertex degree value t 1 in the degree sequence of G 1 and identify largest vertex index say, i for which d G 1 (u i ) = t 1 . Similarly, choose any vertex degree value t 2 in the degree sequence of G 2 and identify largest vertex index say, l for which d G 2 (v l ) = t 2 . Here, we have to consider the following cases.
set the values as follows.
Case-2: In respect of G �� = G 1 ⇝ u k v j G 2 , set the values as follows.
Since Case-1 and Case-2 yield the same result, the result irr t (G � ) = irr t (G �� ) follows from Theorem 2.3. ✷ An immediate consequence of Corollary 2.4 is that for regular graphs G 1 and G 2 we have is a constant. This result is proved in the following proposition.
Proposition 2.5 For the regular graphs G 1 , G 2 on n, m vertices, respectively, with Proof The proof follows immediately from Corollary 2.4. ✷ We note that if G 1 and G 2 are of equal k-regularity, then irr t (G 1 ⇝ uv G 2 ) is independent of the kdegree of the vertices.

Total irregularity due to edge-transformation
Consider a graph G on n = l 1 + l 2 vertices and a cut edge Edge-transformation with respect to u 1 will be the graph G u i v 1 obtained by deleting the edge u 1 v 1 and adding the edge u i v 1 for any i ≠ 1. We call G 1 the master graph and G 2 the slave graph.
Let us now introduce the notion of edge-transformation partitioning of a vertex set of a given graph as follows.
Definition 3.1 The edge-transformation partitioning of the vertex set V(G) of a graph G on n vertices with at least one cut edge say Invoking Definition 3.1, we now define certain vertex sets in G as given below. Let In view of the above notions, we propose the following theorem.

Theorem 3.2 For a graph G with a cut edge u
by exactly s and finally it reduces the the partial sum Case 1: By increasing d G 1 (u i ), u i ∈ V h by 1, the partial sum increases by exactly (h − 1). It decreases the partial sum finally it increases the the partial sum Case 2: By increasing d G 1 (u i ), u i ∈ V s by 1, the partial sum increases by exactly h. It changes the partial sum finally it increases the the partial sum � by exactly s and finally it changes the the partial sum It is to be noted Theorem 3.2 provides an alternate proof for the following that lemma provided in Zhu et al. (in press). Lemma 3.3 (Zhu et al., in press) Let G ′ be the graph obtained from G by branch-transformation from u to v. Then irr t (G) > irr t (G � ).
Theorem 3.2 can be extended to multi graphs also as explained in the following result.

Total irregularities of directed graphs
In this section, we extend the concept of total irregularities of graphs mentioned in above sections to directed graphs. Since the edges of a digraph D are directed edges and the vertices of D has two types of degrees, in-degrees and out-degrees, we need to define two types of total irregularities for a digraph, which are called total in-degree irregularities and total out-degree irregularities.
Let the vertices of a simple directed graph D → on n vertices be labelled as v i ; i = 1, 2, 3, … , n and let d + Then, the notion of total in-irregularity of a given directed graph is introduced as follows.
Definition 4.1 The total in-irregularity of a directed graph D with respect to the in-degree of all ver- Similarly, the total out-irregularity of a digraph can also be defined as follows.
Definition 4.2 The total out-irregularity of a directed graph D with respect to the out-degree of all ver- Re-orientation of an arc or arc-transformation of an arc will find application in most classical applications of directed graphs like tournaments, transportation problems, flow analysis or alike.

Total irregularities of directed paths and cycles
The total in-irregularity and the total out-irregularity of a directed path are determined in the following proposition.

Proposition 4.3 For a directed path P →
n which is consecutively directed from left to right for which vertices v 1 , v n are called the start-vertex and the end-vertex, respectively, we have Proof The proof is obvious from the definition of total in-irregularity and total out-irregularity of a given digraph. ✷ The total in-irregularity and the total out-irregularity of a directed cycle are determined in the following proposition.
Proposition 4.4 For a directed cycle C → n which is consecutively directed clockwise we have , if we reverse the orientation of any arc.
Proof The proof is obvious from the definition of total in-irregularity and total out-irregularity of a given digraph. ✷ Through a simple change of Definition 3.1 the in-arc-transformation partitioning in respect of v 1 and the out-arc-transformation partitioning in respect of v 1 can be defined.
Definition 4.5 The in-arc-transformation partitioning with respect to a vertex v i of the vertex set V(G) of a simple connected directed graph G → on n vertices is defined to be In view of Definition 4.5, we define some vertex sets of a given digraph are defined as follows.
Definition 4.6 The out-arc-transformation partitioning with respect to a vertex v i of the vertex set V(G → ) of a simple connected directed graph G → on n vertices is defined to be In view of Definition 4.5, we define some vertex sets of a given digraph are defined as follows.
Analogous to Theorem 3.2, we propose the following result.

Total irregularities of directed complete graphs
In this section, we initiate a study on the two types of irregularities of directed complete graphs.
Consider a complete undirected graph K n and label the vertices v 1 , v 2 , v 3 , … , v n . Assign direction the edges of K n to get a directed graph, with K n as its underlying graph, in such a way that the edge v i v j becomes the arc (v i , v j ) of this directed graph if i < j. We denote this directed graph by K → n . The following lemma discusses the two types of irregularities of K → n .
Lemma 4.8 For the directed complete graph K → n , the total irregularities are given by Proof The orientation results in an in-degree sequence (0, 1, 2, … , (n − 1)) and an out-degree sequence (n − 1, n − 2, n − 3, … , 0). Choose the k-th entry of the in-degree sequence. We know that the k-th term is given by j = 1 6 n(n 2 − 1). Furthermore, since the out-degree sequence is a mirror image of the in-degree sequence and A general application of this study can be the following.
Consider any connected undirected graph G on n vertices and label its vertices randomly by v 1 , v 2 , v 3 , … , v n . Assign direction to the edges of the graph G to be arcs according to the condition mentioned above and refer to the directed graph as the root directed graph, G → root−graph . Then, calcu- . In a derivative graph G → derivative identify all arcs which were re-oriented or subjected to arc-transformation and apply the applicable results to recursively determine the total in-irregularity and total out-irregularity.  . Here, we have the following cases.
Case 1: For the above-mentioned in-degree sequence of K l→r m,n , we have the sum Case 2: For the above-mentioned out-degree sequence of K l→r m,n , we have the sum �d + (v i ) − d + (v j )� results in the value n, (mn times) and 0, ((m + n) − 2) times). Hence, irr + t (K l→r (1,n) ) = mn 2 . This completes the proof. ✷ Invoking from Proposition 4.9, we note that for the directed bipartite graph K l→r 1,n , we have irr − t (K l→r 1,n ) = n and irr + t (K l→r (1,n) ) = n 2 and irr − t (K l→r m,1 ) = m 2 and irr + t (K l→r m,1 ) = m.
The following is a challenging and interesting problem in this context.

Problem 4.10
Describe an efficient algorithm to determine irr − t (G → derivative ) and irr + t (G → derivative ) from irr − t (G → root−graph ) and irr + t (G → root−graph ).

Conclusion
In this paper, we have studied certain types of total irregularities of certain graphs and digraphs. More problems in this area still remain unsettled. More studies on different types of irregularities for different graph classes, graph operations, graph products and on certain associated graphs such as line graphs and total graphs of given graphs and digraphs remain open. All these facts indicate that there is a wide scope for further investigations in this area.