Rough Identity-Summand Graph and Its Applications
DOI:
https://doi.org/10.26713/jims.v17i1.3060Abstract
This work aims to obtain various Gray code constructions from the structural properties of a rough identity-summand graph. To establish the nature of the rough identity-summand graph defined for the filters of a rough bi-Heyting algebra, the enumeration of distinct complete bipartite graphs from \(G(F_{X}(T))\) will be presented in detail. Then, it will be proved that the union of these distinct complete bipartite graphs forms the subgraph of \(G(F_{X}(T))\). This subgraph will be considered in identifying the various lengths of the Gray codes through two approximation transition sequences.
Downloads
Download data is not yet available.
Downloads
Published
2025-04-29
Issue
Section
Research Article
License
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
How to Cite
Rough Identity-Summand Graph and Its Applications. (2025). Journal of Informatics and Mathematical Sciences, 17(1), 73-104. https://doi.org/10.26713/jims.v17i1.3060
