Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path

Published:2019-07-03 Issue: Volume: Page:2064-2078
ISSN:1303-5991
Container-title:Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics
language:
Short-container-title:

Author:

Ghosh Sumonta,Pal Anita

Publisher

Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics

Subject

General Medicine

Reference20 articles.

1. Gallian, J.A., A dynamic survey of graph labeling, The Electronics Journal of Combinatorics, 17, (2010) 6.

2. Hegde, S.M., On Multiplicative Labelings of a Graph. Labeling of Discrete Structures and applications. Narosa Publishing House. New Delhi. 83-96 2008.

3. Beineke, L.W., Hegde, S.M., Strongly Multiplicative graphs. Discuss.Math. Graph Theory, 21, (2001) 63-75.

4. Cahit, I., Cordial graphs a weaker version of graceful and harmonious graphs. Ars Combin. 23, (1987) 201-207.

5. Cahit, I., On cordial and 3-equitable labellings of graphs. Util. Math. 37, (1990) 189-198.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP