Snakes related strongly*-graphs

I. I. Jadav, G. V. Ghodasara

Strongly*-labeling, Strongly*-graph.

A graph with n vertices is said to be strongly-graph if its vertices can be assigned the values f1; ng in such a way that when an edge whose end vertices are labeled i and j, is labeled with the value i+j+ij such that all edges have distinct labels. Here we derive some snakes related strongly-graphs.

10.22161/ijaers/3.9.33