Certain Types of Total Irregularities of Graphs and Digraphs

Abstract

The total irregularity of a simple undirected graph G is denoted by irrt(G) and is defined as irrt(G) = 12Σu,v ∈ 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…