Total i̇rregulari̇ty of fractal graphs
The irregularity of a simple undirected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] denotes the degree of a vertex [Formula: see text]. The total irregularity of a graph as a new measure of graph irregularity is defined as [Formula: see text]. In this paper, the irregularity and the total irregularity of fractal graphs and the derived graphs from a class of fractal graphs are investigated. Exact formulae are presented for the computation of the irregularity and total irregularity of fractal-type graphs in terms of the parameters of the underlying graphs.
Keyword(s):
2015 ◽
Vol 92
(1)
◽
pp. 1-10
◽
Keyword(s):
2019 ◽
Vol 19
(05)
◽
pp. 2050086
◽
Keyword(s):
Keyword(s):
2009 ◽
Vol 01
(01)
◽
pp. 45-57
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):