Composite Labelling of Some Graphs and Application

EasyChair Preprint no. 7434

Abstract

Let U,V,W∈V(G). A composite labelling is a bijection function f(v(G)∪(E(G))→{1,2,3,…..m+n} such that gcd(f(uv),f(vw))≠1. A graph admits composite labelling is known as Composite Graph. Online shopping is a form of electronic commerce which allows consumers directly to buy goods or services from a seller over the internet using a web browser or a mobile app. In this paper, we are focusing on connection between seller and customer through the star graph k1,n. In addition we show that Composite labelling admit in Star graph, Bipartite graph, Join sum of two copies of cycle(cn), Two copies of even cycles, Two copies of odd cycle, Sunlet graph(sn), Path union of sunlet graph.

Keyphrases: composite Labelling, Graph labelling, star graph

@Booklet{EasyChair:7434,
  author = {A Sethujkkarasi and S Vidyanandini},
  title = {Composite Labelling of Some Graphs and Application},
  howpublished = {EasyChair Preprint no. 7434},

  year = {EasyChair, 2022}}