The irregularity of graphs under graph operations

From MaRDI portal
Publication:2450125




Abstract: The total irregularity of a graph G is defined as irrt(G)=1/2sumu,vinV(G) |dG(u)dG(v)|, where dG(u) denotes the degree of a vertex uinV(G). In this paper we give (sharp) upper bounds on the total irregularity of graphs under several graph operations including join, lexicographic product, Cartesian product, strong product, direct product, corona product, disjunction and symmetric difference.











This page was built for publication: The irregularity of graphs under graph operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450125)