Total Irregularity and ft-Irregularity of Linear Jaco Graphs$

Abstract

Total irregularity of a simple undirected graph G is defined to be irrt(G) = 12Σu, v ∈ V(G)|d(u) - d(v)|. See Abdo and Dimitrov [2]. We allocate the Fibonacci weight, fi to a vertex vj of a simple connected graph, if and only if d(vj) = i and define the total fibonaccian irregularity or ft-irregularity denoted firrt(G) for brevity, as: firrt(G) = Σi=1n-1Σj=i+1n|fi - fj|. The concept of an edge-joint is also introduced to be the simple undirected graph obtained from two simple undirected graphs G and H by linking the edge vuv ∈ V(G), u ∈ V(H). This paper presents results for the undirected underlying graphs of Jaco Graphs, Jn(x). Finally we pose an open problem with regards to firrt(G).

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…