Abstract
The total irregularity of a simple undirected graph G = (V;E) is defined as irrt(G) = 1 P u;v2V (G)jdG(u) dG(v)j, where dG(u) is the degree of the vertexu. In this paper we investigate the change of the total irregularity of graphs under various subdivision operations. Also, we present exact expressions and upper bounds on the total irregularity of different composite graphs such as the double graph, the extended double cover of a graph, the generalized thorn graph, several variants of subdivision corona graphs, and the hierarchical product 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.
