A Study On Absolute Mean Cordial Labeling Of Various Graphs

Article Sidebar

PDF
Published: Dec 25, 2023
DOI: https://doi.org/10.53555/kuey.v29i4.7796
Keywords:
Labeling, Cordial Labeling, Absolute Mean Cordial Labeling.

Main Article Content

P. Z. Akbari
J. C. Kanani
V. J. Kaneria

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
Vol. 29 No. 4 (2023)
Section
Articles
Author Biographies

P. Z. Akbari

Department of Mathematics, Saurashtra University

J. C. Kanani

Department of Mathematics, Saurashtra University

V. J. Kaneria

Department of Mathematics, Saurashtra University