Autor:	K K Kanani, G V Ghodasara
Rok vydání:	2011
Předmět:	Combinatorics Discrete mathematics business.industry Product (mathematics) Path (graph theory) New product development Graph theory business Graph Mathematics
Zdroj:	2011 International Conference on Image Information Processing.
DOI:	10.1109/iciip.2011.6108917
Popis:	Here we investigate product cordial labeling for the path union of wheels as well as shells. We also prove that the graph obtained by joining two copies of wheel by a path of arbitrary length admits product cordial labeling. Similar result is also obtained for two copies of shell.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::5687428355fc6e6d2c76859cc7425a87 https://doi.org/10.1109/iciip.2011.6108917 Zobrazit plný text záznamu