Graceful Labelling for Complete Bipartite Fuzzy Graphs
Journal of Advances in Mathematics and Computer Science · pp. 1–9 · Published 18 May 2017
10.9734/BJMCS/2017/32242Abstract
The concept of fuzzy graceful labelling is introduced. A graph which admits a fuzzy graceful labelling is called a fuzzy graceful graph. Fuzzy graceful labelled graphs are becoming an increasingly useful family of mathematical models for a broad range of applications. In this paper the concept of fuzzy graceful labelling is applied to complete bipartite graphs. Also we discussed the edge and vertex gracefulness of some complete bipartite graphs.
References (5)
- 1 Strong arcs in fuzzy graphs [DOI]
- 2 Symmetry Breaking in Graceful Graphs [DOI]
- 3 A Fuzzy Set Theory Based Methodology for Analysis of Uncertainties in Stage-Discharge Measurements and Rating Curve
- 4 Notes on Types of arcs in a fuzzy graph [DOI]
- 5 International Journal of Fuzzy Mathematical Archive [DOI]
Cited by 3
Muhammed Nadeem, Sarfraz Ahmad, Muhammad Kamran Siddiqui · Journal of Discrete Mathematical Sciences and Cryptography · 2021
Showing 1 of 3 known citations — external sources report more than can currently be individually listed.
Article metrics
Real usage data collected on this platform.
6
Page views
0
PDF downloads
0
Outbound clicks
3
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
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.