Edge irregular reflexive labeling on tadpole graphs Tm,1 and Tm,2

Let G be a connected graph with vertex set V(G) and egde set E(G). An edge irregular reflexive k-labeling is a function fe : E(G) → {1,2,…,ke} and a function fv : V(G) → {0,2,…, 2kv}, where k = max {ke, 2kv} of a graph G such that the weights for all edge are distinct. Under f labeling for edges and...

Full description

Saved in:
Bibliographic Details
Published in:AIP conference proceedings 2021-02, Vol.2326 (1)
Main Authors: Budi, Nadia Indarwati Setia, Indriati, Diari, Winarno, Bowo
Format: Article
Language:English
Subjects:
Apexes
Graph theory
Labeling
Labelling
Vertex sets
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Let G be a connected graph with vertex set V(G) and egde set E(G). An edge irregular reflexive k-labeling is a function fe : E(G) → {1,2,…,ke} and a function fv : V(G) → {0,2,…, 2kv}, where k = max {ke, 2kv} of a graph G such that the weights for all edge are distinct. Under f labeling for edges and vertices, the weight of edge xy in G, denoted by wt(xy) is defined as wt(xy) = f(x) + f(xy) + f(y). The minimum k for which the graph G has an edge irregular reflexive k-labeling is called the reflexive edge strength, denoted by res(G). In this paper, we investigate the reflexive edge strength of tadpole graph Tm,n with m ≥ 3 and n = 1,2.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0039337