z-logo
open-access-imgOpen Access
Product Cordial and Total Product Cordial Labelings of Pn+1m
Author(s) -
Zhen-Bin Gao,
Guang-Yi Sun,
Yuan-Ning Zhang,
Meng Yu,
Gee-Choon Lau
Publication year - 2015
Publication title -
journal of discrete mathematics
Language(s) - English
Resource type - Journals
eISSN - 2090-9837
pISSN - 2090-9845
DOI - 10.1155/2015/512696
Subject(s) - algorithm , product (mathematics) , computer science , artificial intelligence , mathematics , geometry
We proved that Pn+1m is total product cordial. We also give sufficient conditions for the graph to admit (or not admit) a product cordial labeling

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