# Sum Divisor Cordial Labelling of Sunflower Graphs

### A. Aanisha, A. Aanisha, R. Manoharan

#### 2023

#### Abstract

Consider the simple graph G with vertex set W, let g: W→ {1, 2 . . . |W|} be a bijective function of G. The function f is known as SDC labeling if the distinction between the number of lines categorized with 0 and the number of lines categorized with 1 is less than or equal to one such that a line xy is categorized 1 if 2 divides sum of f(x) and f(y), and categorized 0 otherwise for every line. A graph that is having SDC labeling is referred to as an SDC graph. This paper shows that the sunflower graph is an SDC graph for all n≥ 3.

Download#### Paper Citation

#### in Harvard Style

Aanisha A. and Manoharan R. (2023). **Sum Divisor Cordial Labelling of Sunflower Graphs**. In *Proceedings of the 1st International Conference on Artificial Intelligence for Internet of Things: Accelerating Innovation in Industry and Consumer Electronics - Volume 1: AI4IoT*; ISBN 978-989-758-661-3, SciTePress, pages 305-308. DOI: 10.5220/0012614800003739

#### in Bibtex Style

@conference{ai4iot23,

author={A. Aanisha and R. Manoharan},

title={Sum Divisor Cordial Labelling of Sunflower Graphs},

booktitle={Proceedings of the 1st International Conference on Artificial Intelligence for Internet of Things: Accelerating Innovation in Industry and Consumer Electronics - Volume 1: AI4IoT},

year={2023},

pages={305-308},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0012614800003739},

isbn={978-989-758-661-3},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the 1st International Conference on Artificial Intelligence for Internet of Things: Accelerating Innovation in Industry and Consumer Electronics - Volume 1: AI4IoT

TI - Sum Divisor Cordial Labelling of Sunflower Graphs

SN - 978-989-758-661-3

AU - Aanisha A.

AU - Manoharan R.

PY - 2023

SP - 305

EP - 308

DO - 10.5220/0012614800003739

PB - SciTePress