Recent Advancements in Graph Theory

13Gaussian Vertex Prime Labeling of Some Graphs Obtained from Origami Models

N P Shrimali

Department of Mathematics,Gujarat University,Ahmedabad, Gujarat (INDIA)E-mail: [e-mail]

S K Singh

Department of Mathematics,Gujarat University,Ahmedabad, Gujarat (INDIA)E-mail: [e-mail]

A graph with edge set E has a Gaussian vertex prime labeling if its edges can be labeled with first |E| Gaussian integers γ₁, γ₂, …, γ_|E| such that for each vertex of degree at least 2 the greatest common divisor of the labels on its incident edges is unit. A graph which admits Gaussian vertex prime labeling is known as a Gaussian vertex prime graph. In this chapter, we investigate Gaussian vertex prime labeling for a boreale star graph, holiday ...