English

Total Irregularity and $f_t$-Irregularity of Linear Jaco Graphs$

Combinatorics 2016-01-13 v3

Abstract

Total irregularity of a simple undirected graph GG is defined to be 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)|. 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 ftirregularityf_t-irregularity denoted firrt(G)firr_t(G) for brevity, as: firrt(G)=i=1n1j=i+1nfifj.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 vuvV(G),uV(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).

Keywords

Cite

@article{arxiv.1406.6168,
  title  = {Total Irregularity and $f_t$-Irregularity of Linear Jaco Graphs$},
  author = {Johan Kok},
  journal= {arXiv preprint arXiv:1406.6168},
  year   = {2016}
}

Comments

11 pages. Minor typographical errors corrected. An erroneous table replaced and standardized notation introduced