Version 1
: Received: 12 August 2022 / Approved: 15 August 2022 / Online: 15 August 2022 (11:27:42 CEST)
How to cite:
Susanti, Y.; Haq, M.A. On the Total Edge Irregularity Strength of Odd and Even Staircase Graphs. Preprints2022, 2022080259. https://doi.org/10.20944/preprints202208.0259.v1
Susanti, Y.; Haq, M.A. On the Total Edge Irregularity Strength of Odd and Even Staircase Graphs. Preprints 2022, 2022080259. https://doi.org/10.20944/preprints202208.0259.v1
Susanti, Y.; Haq, M.A. On the Total Edge Irregularity Strength of Odd and Even Staircase Graphs. Preprints2022, 2022080259. https://doi.org/10.20944/preprints202208.0259.v1
APA Style
Susanti, Y., & Haq, M.A. (2022). On the Total Edge Irregularity Strength of Odd and Even Staircase Graphs. Preprints. https://doi.org/10.20944/preprints202208.0259.v1
Chicago/Turabian Style
Susanti, Y. and Muhammad Arinal Haq. 2022 "On the Total Edge Irregularity Strength of Odd and Even Staircase Graphs" Preprints. https://doi.org/10.20944/preprints202208.0259.v1
Abstract
A total $m$-labelling $\alpha$ on graph $\Gamma$ is called an edge irregular total $m$-labelling if for any two different edges of $\Gamma$, their weights respect to $\alpha$ are distinct, where the weight of any edge is defined as the sum of its label and the labels of its end vertices. We determine the minimum $m$ such that $\Gamma$ can be labelled by an edge irregular total $m$-labelling whenever $\Gamma$ is an odd staircase graph or an even staircase graph.
Keywords
total edge irregularity strength; odd staircase graphs; even staircase graphs
Subject
Computer Science and Mathematics, Computer Vision and Graphics
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
