Year: 2024
Type: article
Abstract: Let G (V,E) be a simple connected undirected graph. Let |V|=p, |E|=q and let C = { 1,2..., p+q}. G is said to admit cardinal labeling if the one-to-one function f from the vertex set V into the set C generates a one-to-one edge function f* onto the set C\f (V) defined by |f(u)-f(v)|= f*(uv) ∀ uv ∈ E. A graph G is said to be cardinal if it admits cardinal labeling. In this paper we have discussed cardinal labeling for H- graph H_n, subdivided H-graph S(H_n), corona of H-graphH_n ⨀▒K_1 ,H_n ⨀▒〖mK〗_1 and H-cracker graphH_(n,k).
Author: A. Punitha Tharani
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4403404918