Rough Identity-Summand Graph and Its Applications

Authors

  • B. Praba Department of Mathematics, Sri Sivasubramaniya Nadar College of Engineering (affiliated to Anna University), Chennai, Tamil Nadu, India https://orcid.org/0000-0002-6974-0328
  • L. P. Anto Freeda Department of Mathematics, Sri Sivasubramaniya Nadar College of Engineering (affiliated to Anna University), Chennai, Tamil Nadu, India https://orcid.org/0009-0000-2773-9014

DOI:

https://doi.org/10.26713/jims.v17i1.3060

Abstract

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
CITATION

How to Cite

Praba, B., & Freeda, L. P. A. (2025). Rough Identity-Summand Graph and Its Applications. Journal of Informatics and Mathematical Sciences, 17(1), 73–104. https://doi.org/10.26713/jims.v17i1.3060

Issue

Section

Research Article