Skip to content
Research Article Open access CC BY 4.0

Some E-Cordial Labelings on Extended Duplicate Graph of Comb Graph

K. Sutha, K. Thirusangu, S. Bala

Journal of Advances in Mathematics and Computer Science · pp. 1–15 · Published 8 Nov 2016

10.9734/BJMCS/2016/29083

Abstract

A graph labeling is a mapping that carries a set of graph elements onto a set of numbers called labels (usually the set of integers). In this paper we prove the existence of graph labeling such as E- cordial, total E- cordial, product E-cordial, total product E-cordial, Prime E- cordial and E3- cordial labeling for the extended duplicate graph of Comb graph by presenting algorithms.

Graph labeling comb graph duplicate graph

Cited by 1

Group{1,−1,i,−i}Cordial labeling in certain classes of duplicate graphs

P. Vijayakumar, R. Jegan, K. Thirusangu · 2020

Related research

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

1

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.