Header menu link for other important links
Computing Narayana Prime Cordial Labeling of Web Graphs and Flower Graphs
, Thirusangu K, Murali B.J.
Published in Springer Singapore
Volume: 904
Pages: 411 - 419
The process of assigning the binary numbers 0 and 1 to the edges of a graph G = (V,E) through evaluating functions defined on the vertex set V and the edge set E of G using the concepts of prime and Narayana numbers by satisfying cordiality on the edges. This process on the graph G is known as Narayana prime cordial labeling of G and this graph G is called Narayana prime cordial graph. In this article, we compute the Narayana prime cordial labeling of Web graphs and Flower graphs. © 2019, Springer Nature Singapore Pte Ltd.
About the journal
JournalData powered by TypesetAdvances in Intelligent Systems and Computing Ambient Communications and Computer Systems
PublisherData powered by TypesetSpringer Singapore
Open AccessNo