ABOUT US
JOURNALS
ANNUAL SUBSCRIPTION
OUR TEAM
Join Us

Bulletin of Pure and Applied Sciences- Math& Stat. (Started in 1982)
eISSN: 2320-3226
pISSN: 0970-6577
Impact Factor: 4.895 (2017)
DOI: 10.5958/2320-3226
Editor-in-Chief:  Prof. Dr. Lalit Mohan Upadhyaya
About Journal More Archive Visit IndianJournals.com
Current Issue
Archive
Guide for Authors
Journal's Ethics & Policies
Editorial Board
Reviewer Board
Indexing
UGC Protocol Part 1
 
Article Details

Bulletin of Pure and Applied Sciences- Math& Stat. (Started in 1982)
Year : 2021, Volume & Issue : BPAS-Maths & Stat 40E(2), JUL-DEC 2021
Page No. : 135-139, Article Type : Original Aticle
Article DOI : 10.5958/2320-3226.2021.00014.X (Communicated, edited and typeset in Latex by Lalit Mohan Upadhyaya (Editor-in-Chief). Received February 22, 2020 / Revised July 18, 2021 / Accepted August 03, 2021. Online First Published on December 17, 2021)

Cordial labeling on different types of nested triangular graphs

J. Jeba Jesintha1 and D. Devakirubanithi2
Author’s Affiliation : 1. P.G. Department of Mathematics, Womens Christian College, University of Madras, Chennai, India. 2. Department of Mathematics, St. Thomas College of Arts and Science, University of Madras, Chennai, India. 1. E-mail: [email protected] 2. [email protected]

Corresponding Author : J. Jeba Jesintha,
E-Mail:-[email protected]


Abstract

A function $f: V(G) o {0, 1}$ is called the binary vertex labeling of a graph $G$ and $f(v)$ are called the labels of the vertex $v$ of $G$ under $f$. For an edge $e=(u,v)$, the induced function $f:E(G) o {0, 1}$ is defined as $f(e)=left|fleft(u ight)-f(v) ight|$. Let ${ v}_fleft(0 ight),v_f(1)$ be the number of vertices of $G$ having labels 0 and 1 respectively under $f$ and $e_fleft(0 ight),e_f(1)$ be the number of edges of $G $ having labels 0 and 1 respectively under $f$. A binary vertex labeling $f$ of a graph $G$ is called cordial labeling if $left|v_fleft(0 ight)-v_f(1) ight|le 1 $ and $left|e_fleft(0 ight)-e_f(1) ight|le 1$ . A graph which admits cordial labeling is called a cordial graph. In this paper we prove the  cordial labeling for the Nested Triangle graph, the Shadow graph of the Nested Triangle graph and the double graph of the Nested Triangle graph.

2020 Mathematics Subject Classification: 05C78.

Keywords

Cordial labeling, Nested Triangle graph, Shadow graph, Double graph.
Download Now

(Only for Authors and Members Not for Commercial Sale)

 

All rights reserved. Website Designed and Maintained by LASERWEBMAKER.COM

Publisher Ethics & Policies    |Downloads    |    Article Submission   |    Payment    |    Contact Us