Some cycle and path related strongly*-graphs

I. I. Jadav; G. V. Ghodasara

doi:https://doi.org/10.14445/22315373/IJMTT-V51P537

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 51 | Number 4 | Year 2017 | Article Id. IJMTT-V51P537 | DOI : https://doi.org/10.14445/22315373/IJMTT-V51P537

Some cycle and path related strongly*-graphs

I. I. Jadav, G. V. Ghodasara

Abstract

A graph with n vertices is said to be strongly*-graph if its vertices can be assigned the values {1, 2,….., n} 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 different strongly*-graphs in context of some graph operations.

Keywords

Strongly*-labeling, Strongly*- graph.

References

[1] J. A. Gallian, A dynemic survey of graph labeling, The Electronics Journal of Combinatorics, (2015), DS6 1 - 389.
[2] F. Harary, Graph theory, Addison-Wesley, Reading, Massachusetts, (1969).
[3] C. Adiga and D. Somnashekara, Strongly_-graphs, Math. Forum, 13(1999), 31-36.
[4] M. A. Seoud and A. E. A. Mahran, Some notes on strongly_-graphs, preprint.
[5] M. A. Seoud and A. E. A. Mahran, Necessary conditions for strongly_-graphs, AKCE Int. J. Graphs Comb., 9, No. 2(2012); 115 - 122.

Citation :

I. I. Jadav, G. V. Ghodasara, "Some cycle and path related strongly*-graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 51, no. 4, pp. 276-282, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V51P537