Aug 2026· Journal of Applied Sciences and Modelling· Vol 2, pp. 120-125· 0 citations
TL;DR
It is demonstrated that these graphs permit intuitionistic fuzzy cube difference graphs (IFCDGs) by assigning distinct MS and NMS values within the range of [0, 1].
Abstract
Intuitionistic fuzzy graph labeling is a useful approach for describing uncertainty based on membership (MS) and non-membership (NMS) values. This work studies Intuitionistic Fuzzy Cube Difference Labeling (IFCDL) on ladder-based graphs and corona products. Explicit labeling techniques are designed for ladder graphs, open ladder graphs, slanting ladder graphs, circular ladder graphs, and Mobius ladder graphs. It is demonstrated that these graphs permit intuitionistic fuzzy cube difference graphs (IFCDGs) by assigning distinct MS and NMS values within the range of [0, 1]. The suggested framework is adaptable to different graph products and complicated network models, with potential applications in decision-making, communication networks, and uncertainty-based systems.
Spherical interval-valued fuzzy graphs (SIvFGs) represent a further advancement of the original concept of spherical fuzzy graphs (SFGs). Within this framework, the balanced spherical fuzzy graph forms a distinct subclass that highlights equilibrium in structural relationships. In this study, we introduce the concept o...
T. Gaketem, T. Prommai, Patcharapan Jumnongnit· International Journal of Ana...· 0 citations
Level graphs and strong level graphs are introduced as tools to define and compute the chromatic number of BIFGs, demonstrating that the proposed level-graph method yields exact chromatic numbers for classes of BIFGs.
Fikadu Tesgera Tolasa, V. N. S. R. Repalle, G. A. Ganati et al.· F1000Research· 0 citations
In this work, we study the notion of cubic fuzzy competition graphs as a hybrid framework for modeling competitive interactions under uncertainty. The proposed model combines the structure of competition graphs with cubic fuzzy information, where each arc or induced competition relation is described by a point membersh...
M. Ragavi, T. Kannan· INTERNATIONAL JOURNAL OF MAT...· 0 citations
Hypergraphs extend classical graphs by allowing hyperedges to connect more than two vertices, while superhypergraphs further generalize this framework through iterated powerset constructions that capture hierarchical and nested incidence structures. Within fuzzy graph theory, anti-fuzzy graphs provide max-oriented unce...
Takaaki Fujita, Ajoy Kanti Das, Suman Das et al.· Sustainable Machine Intellig...· 1 citation
We study interval-valued fuzzy weighted graphs whose edge memberships are known only through closed intervals and investigate how this uncertainty propagates to the Laplacian spectrum. For every admissible realization we define the fuzzy weighted Laplacian and prove that the edgeto-Laplacian map is monotone in the Loew...
Asokan Vasudevan Et.al., Y. N., K. Roy· Global and Stochastic Analys...· 0 citations
Computer science applications make extensive use of graph theory. Information mining, picture classification, grouping images, photo capture, and connectivity are particularly important study areas in computer science. Fuzzy labelling models provide better accuracy, adaptability, and interoperability to the framework t...
Uma Maheswari Subbiah, Shalini Ramachandran· Advanced International Journ...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
