Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
