Abstract
The irregularity of a graph G is the sum of $$|\mathrm{deg}(u) - \mathrm{deg}(v)|$$ over all edges uv of G. In this paper, this invariant is considered on $$\pi $$ -permutation graphs, Fibonacci cubes, and trees. An upper bound on the irregularity of $$\pi $$ -permutations graphs is given, and $$\pi $$ -permutation graphs that attain the equality are characterized. The concept of the irregularity is extended to arbitrary edge subsets and applied to permutation edges of $$\pi $$ -permutation graphs. An exact formula for the irregularity of Fibonacci cubes is proved. An upper bound on the irregularity of trees in terms of the diameter is given, and trees that attain the equality are characterized.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Bulletin of the Malaysian Mathematical Sciences Society
Disclaimer: 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.