z-logo
HomeZAIABlog
open-access-imgOpen Access
Prime Cordial Labeling For Some Graphs
Author(s) -
S. K. Vaidya,
P L Vihol
Publication year - 2010
Publication title -
modern applied science
Language(s) - English
Resource type - Journals
eISSN - 1913-1852
pISSN - 1913-1844
DOI - 10.5539/mas.v4n8p119
Subject(s) - prime (order theory) , combinatorics , computer science , graph , edge graceful labeling , mathematics , line graph , graph power

We present here prime cordial labeling for the graphs obtained by some graph operations on given graphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

AboutCareersPublisher PartnersContact UsGet Organisational Trial or Quote

Learn

FAQsBlogTerms of UsePrivacy Policy

Download the Zendy App

Get it on
Google Play
Download on the
App Store

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.