Maximum and Minimum 3-Equitable
Labeling For Some Graphs

V J Kaneria; M J Khoda

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 66 | Issue 4 | Year 2020 | Article Id. IJMTT-V66I4P508 | DOI : https://doi.org/10.14445/22315373/IJMTT-V66I4P508

Maximum and Minimum 3-Equitable Labeling For Some Graphs

V J Kaneria, M J Khoda

Abstract

In the research paper, we have defined maximum and minimum 3-equitable labeling. Also, we have figured out the labeling for path, cycle and star graph.

Keywords

Maximum 3-equitable labeling, Minimum 3-euitable labeling, Path, Cycle, Star graph.

References

[1] I. Cahit, On cordial and 3-equitable labeling of graphs, Until. Math., 37,(1990), pp. 189 – 198.
[2] J A Gallian, A dynamic survey of graph labeling, The electronics J. of combin., 18(2011), #Ds6.
[3] F Harry, Graph Theory, Addision wisely, New Delhi (1972).
[4] V J Kaneria, Meera Meghpara and Maulik Khoda, Geometric mean 3-equitable labeling of some graphs, Int. J. of Scientific Research and Reviews, 7(1)2018, pp. 245 – 250.

Citation :

V J Kaneria, M J Khoda, "Maximum and Minimum 3-Equitable Labeling For Some Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 66, no. 4, pp. 52-58, 2020. Crossref, https://doi.org/10.14445/22315373/IJMTT-V66I4P508