Work

On Sum Cordialness of Some Fractal Graph

Year: 2025

Type: article

Abstract: For a graph G with vertex set V is a function f: V(G) →{0.1} with induced edge labeling such that f# : E(G) →{0,1} such that f# (pq) = (f(p) + f(q)) (mod 2) for all pq \(\in\) E(G) is called a sum cordial labeling, If |v(0) - v(1)|\(\le\) 1 and |e(0) - e(1)|\(\le\) 1. A graph that follows sum cordial labeling is called a sum cordial graph. We have proved that Vicsek fractal, Box fractal, Ladder Fractal Graph of Type – 1 to Type – 4 admits sum cordial labeling.

Source: Asian Research Journal of Mathematics

DOI: 10.9734/arjom/2025/v21i10994

Authors: Nishant J. Khiraiya, Mehul A. Chaurasia

Institution: Darshan University

Language: English

Topic: Graph Labeling and Dimension Problems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4414929653

FWCI:

Cites:

Cited by:

Related to: