Mean Cordial Labeling Patterns In Shadow- Graphs Of Paths

Author(s)	ANSARI SAIMA
Country	India
Abstract	Let f be a function from V (G) to {0,1,2}. Give a numerical value (label) from {0, 1, 2} for every edge uv. f is called a mean cordial labeling if \|v_f (i)-v_f (j)\|≤1 and \|e_f (i)-e_f (j)\|≤1, ∀ i,j ∈ {0,1,2} where v_f (x) and e_f (x) represent the number of vertices and edges respectively labeled as x(x = 0,1,2). A graph with mean cordial labeling is called a mean cordial graph. In this paper, we study the mean cordial labeling pattern of shadow-graphs of path graphs D_2 (P_n ), for n≥2
Keywords	mean cordial labeling, Shadowgraph, path graph.
Field	Mathematics
Published In	Volume 16, Issue 1, January-March 2025
Published On	2025-02-07
Cite This	Mean Cordial Labeling Patterns In Shadow- Graphs Of Paths - ANSARI SAIMA - IJSAT Volume 16, Issue 1, January-March 2025. DOI 10.71097/IJSAT.v16.i1.1703
DOI	https://doi.org/10.71097/IJSAT.v16.i1.1703
Short DOI	https://doi.org/g84j98

About IJSAT Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us	Message on WhatsApp	+91-9687-182-185	editor@ijsat.org

International Journal on Science and Technology