Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Conferences
Narayana prime cordial labeling of grid graph
A.A. Rani
,
K. Thirusangu
,
Balamurugan B J
,
A. Manonmani
Published in American Institute of Physics Inc.
2020
DOI:
10.1063/5.0028719
Volume: 2282
Abstract
Let G = (V, E) be a graph. The binary numbers 0 and 1 have been allotted to the edges of the graph G through the evaluating functions defined on V and E by ensuring the cordiality conditions. This has been obtained through the prime and the Narayana numbers. Any graph G which admits this labeling is known as Narayanaprime cordial graph. In this research paper, we compute the Narayana prime cordial labeling of Grid graphs. © 2020 Author(s).
Topics:
Narayana number
(67)%
67% related to the paper
,
Lattice graph
(66)%
66% related to the paper
and
Prime (order theory)
(56)%
56% related to the paper
View more info for "
Narayana prime cordial labeling of grid graph
"
Request full-text
Cite
Content may be subject to copyright.
Journal Details
Authors (1)
About the journal
Journal
Data powered by Typeset
AIP Conference Proceedings
Publisher
Data powered by Typeset
American Institute of Physics Inc.
ISSN
0094243X
Authors (1)
Balamurugan B J
Mathematics
School of Advanced Sciences
Chennai Campus
Recent publications
Analysis of performance measures to handle medical E-commerce shopping cart abandonment in cloud
Relevance Feedback Base User Convenient Semantic Query Processing Using Neural Network
Study of characteristics of large data collections to build a high performance system
Cloud based automated framework for semantic rich ontology construction and similarity computation for E-health applications
Get all the updates for this publication
Follow