Abstract
On friendly index set of graphs
Highlights
For all terminology and notations in graph theory we follow harary[3]
In this paper we find the friendly index set of the umbrella graph, Spl(K1,n), Globe graph,P2+mk1 and union of a path and a star sharing a vertex in common
Definition 2.6 [6] : A globe is a graph obtained from two isolated vertex are joined by n paths of length two
Summary
For all terminology and notations in graph theory we follow harary[3]. Unless mentioned or otherwise a graph in this paper shall mean a simple finite graph without isolated vertices. The friendly index set of a graph G is FI(G) = {|e0(f) - e1(f)|, where f runs over all friendly labelings f of G}. In this paper we find the friendly index set of the umbrella graph, Spl(K1,n), Globe graph ,P2+mk1 and union of a path and a star sharing a vertex in common. Let G be a graph with vertex set V(G) and edge set E(G).
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
