English

Certain Types of Total Irregularities of Graphs and Digraphs

Combinatorics 2015-05-20 v3

Abstract

The total irregularity of a simple undirected graph GG is denoted by irrt(G)irr_t(G) and is defined as irrt(G)=12u,vV(G)d(u)d(v)irr_t(G) = \frac{1}{2}\sum\limits_{u,v \in V(G)}|d(u) - d(v)|. In this paper, the concept called edge-transformation in relation to total irregularity of simple undirected graphs with at least one cut edge is introduced. We also introduce the concept of an edge-joint between two simple undirected 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.

Keywords

Cite

@article{arxiv.1406.6863,
  title  = {Certain Types of Total Irregularities of Graphs and Digraphs},
  author = {Johan Kok and Sudev Naduvath},
  journal= {arXiv preprint arXiv:1406.6863},
  year   = {2015}
}

Comments

12 pages. A complete revision was done. A title change was also adopted. This version will be submitted to the Asian-European Journal of Mathematics