2000 character limit reached
The Total Irregularity of Graphs under Graph Operations
Published 31 Mar 2013 in cs.DM and math.CO | (1304.0185v1)
Abstract: The total irregularity of a graph $G$ is defined as $\irr_t(G)=1/2 \sum_{u,v \in V(G)}$ $|d_G(u)-d_G(v)|$, where $d_G(u)$ denotes the degree of a vertex $u \in V(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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.