pith. sign in

arxiv: 1406.6863 · v3 · pith:CBGJBCYRnew · submitted 2014-06-26 · 🧮 math.CO

Certain Types of Total Irregularities of Graphs and Digraphs

classification 🧮 math.CO
keywords simpletotalgraphsundirectedconceptirregularitycalleddigraphs
0
0 comments X
read the original abstract

The total irregularity of a simple undirected graph $G$ is denoted by $irr_t(G)$ and is defined as $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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.