Article
Version 1
Preserved in Portico This version is not peer-reviewed
Computing the Total $H$-irregularity Strength of Edge Comb Product of Graphs
Version 1
: Received: 12 August 2022 / Approved: 16 August 2022 / Online: 16 August 2022 (03:51:18 CEST)
How to cite: Wahyujati, M. F.; Susanti, Y. Computing the Total $H$-irregularity Strength of Edge Comb Product of Graphs. Preprints 2022, 2022080274. https://doi.org/10.20944/preprints202208.0274.v1 Wahyujati, M. F.; Susanti, Y. Computing the Total $H$-irregularity Strength of Edge Comb Product of Graphs. Preprints 2022, 2022080274. https://doi.org/10.20944/preprints202208.0274.v1
Abstract
A simple undirected graph $\Gamma=(V_\Gamma,E_\Gamma)$ admits an $H$-covering if every edge in $E_\Gamma$ belongs to at least one subgraph of $\Gamma$ that isomorphic to a graph $H$. For any graph $\Gamma$ admitting $H$-covering, a total Labelling $\beta: V_\Gamma \cup E_\Gamma \longrightarrow \{1,2,\dots,p\}$ is called an $H$-irregular total $p$-labelling of $\Gamma$ if every two different subgraphs $H_1$ and $H_2$ of $\Gamma$ isomorphic to $H$ have distinct weights where the weight $w_\beta(K)$ of subgraph $K$ of $\Gamma$ is defined as $w_f(K):=\displaystyle \sum_{v\in V_K} f(v) + \sum_{e\in E_K} f(e)$. The smallest number $p$ for which a graph $\Gamma$ admits an $H$-irregular total $p$-labelling is called the total $H$-irregularity strength of $\Gamma$ and is denoted by $ths(\Gamma)$. In this paper, we determine the total $H$-irregularity strength of edge comb product of two graphs.
Keywords
Total H-Irregular Strength; Edge Comb Product Graph; Cycle; Path
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.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment