Share

Export Citation

APA
MLA
Chicago
Harvard
Vancouver
BIBTEX
RIS
Universitas Hasanuddin
Research output:Contribution to journalArticlepeer-review

The Total H-Irregularity Strength of Some Graph Classes

Shulhany A.

Aip Conference Proceedings

Published: 2022

Abstract

Let G be an undirected, simple, nontrivial, and finite graphs admitting an H-covering. The total s-labeling a: V(G) ᴜ E(G) ➔ {1,2, …, s} is called a total H-irregular s-labeling of G if for any pair of subgraphs H'≅H and H''≅H, it holds ω(H') ≠ ω(H'') when H' ≠ H''. Define an H-weight, denoted by ω(H), which sum of all edge and vertex labels in subgraph H ⊆ G under the total s-labeling. The smallest positive integer s such that G has an H-irregular total s-labeling is the total H-irregularity strength of G, denoted by ths(G, H). A (n, 1)-tadpole graph is a graph on n+1 vertices and denoted by Tdn. In this paper, we find ths of of some graphs with Tdn-covering, i.e. generalized butterfly graphs, and eclipse graphs.

Access to Document

10.1063/5.0102491

Other files and links

Fingerprint

CombinatoricsSciences
MathematicsSciences
Vertex (graph theory)Sciences
GraphSciences
Undirected graphSciences
Integer (computer science)Sciences
Discrete mathematicsSciences
Computer scienceSciences
Programming languageSciences