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
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.