A Study On Absolute Mean Cordial Labeling Of Various Graphs
Main Article Content
Abstract
In this paper we investigate absolute mean cordial labeling for some graphs. We have proved that complete biapartite graph Km,n, grid graph Pm × Pn, step grid graph Stn, double step grid graph DStn, wheel Wn, sunlet graph Sn, gear graph Gn, swastik graph SWn, sunflower graph SFn, flower graph Fn and extended friendship graph F4,n are absolute mean cordial graphs.
Downloads
Download data is not yet available.
Article Details
How to Cite
P. Z. Akbari, J. C. Kanani, & V. J. Kaneria. (2023). A Study On Absolute Mean Cordial Labeling Of Various Graphs. Educational Administration: Theory and Practice, 29(4), 3094–3102. https://doi.org/10.53555/kuey.v29i4.7796
Issue
Section
Articles