Total Irregularity and $f_t$-Irregularity of Linear Jaco Graphs$
Combinatorics
2016-01-13 v3
Abstract
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: 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 . This paper presents results for the undirected underlying graphs of Jaco Graphs, . Finally we pose an open problem with regards to
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