Total irregularity of a simple undirected graph is defined to be . See Abdo and Dimitrov [2]. We allocate the \emph{Fibonacci weight,} to a vertex of a simple connected graph, if and only if and define the \emph{total fibonaccian irregularity} or denoted for brevity, as: $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 and by linking the edge $vu_{v \in V(G), u \in V(H)}$. This paper presents results for the undirected underlying graphs of Jaco Graphs, . Finally we pose an open problem with regards to

生成讲解博客的中文版本

生成AI智能校验的中文版本