New types of graphs on cordial labeling
9.38$
New types of graphs on cordial labeling
Jeba Jesintha1, D. Devakirubanithi2 and R. Charishma3
BPAS-E-Math and Stat. Vol.42E(1) June 2023
DOI: 10.48165/bpas.2023.42E.1.5
Page: 36-42
Description
Description
New types of graphs on cordial labeling
- Jeba Jesintha1, D. Devakirubanithi2 and R. Charishma3
1,3. P.G. Department of Mathematics, Women’s Christian College, University of Madras, Chennai, India.
- Department of Mathematics, St Thomas College of Arts and Science, University of Madras, Chennai, India.
- Research Scholar (Part-Time), P.G. Department of Mathematics, Women’s Christian College, University of Madras, Chennai, India.
- E-mail: jjesintha_75@yahoo.com , 2. E-mail: kiruba.1980@yahoo.com
- E-mail: charishma26042000@gmail.com
Communicated, edited and typeset in Latex by Lalit Mohan Upadhyaya (Editor-in-Chief).
Received October 24, 2022 / Revised April 29, 2023 / Accepted May 14, 2023. Online First Published
on June 30, 2023 at https://www.bpasjournals.com/.
Â
Corresponding author J. Jeba Jesintha, E-mail: jjesintha_75@yahoo.com
Abstract
Let $f$ be a function from the vertices of a graph $G$ to $\{0,1\}$ and for each edge $xy$ assign the label $|f(x)-f(y)|$. $f$ is called as a \textit{cordial labeling} of $G$ if the number of vertices labeled $0$ and the number of vertices labeled $1$ differ by at most $1$ and the number of edges labeled $ 0$ and the number of edges labeled $1$ also differ at most by $1$. In this paper we prove that star glued with subdivided shell graph and super subdivision of circular ladder graph admit cordial labeling.
Key words Shell graph, subdivided shell graph, star graph, super subdivision, circular ladder graph.
2020 Mathematics Subject Classification 05C78.
