Abstract
We investigate prime labeling for some graphs resulted from switching of a vertex. We discuss switching invariance of some prime graphs and prove that the graphs obtained by switching of a vertex in Pn and K1,n admit prime labeling. Moreover we discuss prime labeling for the graph obtained by switching of vertex in wheel Wn.
Highlights
Introduction and DefinitionsWe begin with simple, finite, undirected and non-trivial graph G = V G, E G, with vertex set V G and edge set E G
We investigate prime labeling for some graphs resulted from switching of a vertex
We discuss switching invariance of some prime graphs and prove that the graphs obtained by switching of a vertex in Pn and K1,n admit prime labeling
Summary
We investigate prime labeling for some graphs resulted from switching of a vertex. We discuss switching invariance of some prime graphs and prove that the graphs obtained by switching of a vertex in Pn and K1,n admit prime labeling. We discuss prime labeling for the graph obtained by switching of vertex in wheel Wn .
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
