Some results and examples on vertex equitable labeling

Authors

Mohamed Saied Aboshady, The British University in EgyptFollow
Reda Amin Elbarkoki, Ain Shams UniversityFollow
Eliwa Mohamed Roshdy, Arab Academy for Science & TechnologyFollow
Mohamed Abdel Azim Seoud, Ain Shams UniversityFollow

Document Type

Article

Publication Date

Winter 12-2019

Abstract

In this paper we present a survey for all graphs with order at most 6 whether they are vertex equitable or not and we get an upper bound for the number of edges of any graph with 𝑝 vertices to be a vertex equitable graph. Also, we establish vertex equitable labeling for the 𝑚-chain of the complete bipartite graph 𝐾2,𝑛 and for the graph 𝑃𝑛 × 𝑃𝑚.

Recommended Citation

Aboshady, Mohamed Saied; Elbarkoki, Reda Amin; Roshdy, Eliwa Mohamed; and Seoud, Mohamed Abdel Azim, "Some results and examples on vertex equitable labeling" (2019). Basic Science Engineering. 18.
https://buescholar.bue.edu.eg/basic_sci_eng/18