Sum divisor cordial labeling of disjoint union of paths and subdivided star

A bijective map ρ from V(Ω) →{1,2, ... |V(Ω)|} is called sum divisor cordial labeling for graph Ω so that for every uυ ∈ E(Ω) edge is fixed the label 1 if 2 divides ρ (u) + ρ(υ) and 0 otherwise, then the difference between number of edges labeled with 1 and the number of edges labeled with 0 by at m...

Full description

Saved in:
Bibliographic Details
Published inJournal of discrete mathematical sciences & cryptography Vol. 25; no. 8; pp. 2467 - 2478
Main Authors Raheem, A., Javaid, M., Numan, M., Hasni, R.
Format Journal Article
LanguageEnglish
Published Taylor & Francis 17.11.2022
Subjects
Paths
Subdivided star
Sum divisor cordial labeling
Online AccessGet full text

Cover

More Information
Summary:A bijective map ρ from V(Ω) →{1,2, ... |V(Ω)|} is called sum divisor cordial labeling for graph Ω so that for every uυ ∈ E(Ω) edge is fixed the label 1 if 2 divides ρ (u) + ρ(υ) and 0 otherwise, then the difference between number of edges labeled with 1 and the number of edges labeled with 0 by at most 1. A graph is called sum divisor cordial graph if it admits sum divisor cordial labeling. In present article, we investigate the disconnected graph such as the disjoint union of paths and subdivided star are sum divisor cordial graphs.
ISSN:0972-0529
2169-0065
DOI:10.1080/09720529.2020.1864935