Total Irregularity and ftf_t-Irregularity of Linear Jaco Graphs$

preprint2016arXivOpen access

Abstract

Total irregularity of a simple undirected graph GG is defined to be irrt(G)=12∑u,v∈V(G)∣d(u)−d(v)∣irr_t(G) = \frac{1}{2}\sum\limits_{u, v \in V(G)}|d(u) - d(v)|. See Abdo and Dimitrov [2]. We allocate the \emph{Fibonacci weight,} fif_i to a vertex vjv_j of a simple connected graph, if and only if d(vj)=id(v_j) = i and define the \emph{total fibonaccian irregularity} or ft−irregularityf_t-irregularity denoted firrt(G)firr_t(G) for brevity, as: firrt(G)=∑i=1n−1∑j=i+1n∣fi−fj∣.firr_t(G) = \sum\limits_{i=1}^{n-1}\sum\limits_{j=i+1}^{n}|f_i - f_j|. The concept of an \emph{edge-joint} is also introduced to be the simple undirected graph obtained from two simple undirected graphs GG and HH by linking the edge vuv∈V(G),u∈V(H)vu_{v \in V(G), u \in V(H)}. This paper presents results for the undirected underlying graphs of Jaco Graphs, Jn(x)J_n(x). Finally we pose an open problem with regards to firrt±(G).firr_t^\pm(G).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.