Have a personal or library account? Click to login
Generation of Gray Codes Through the Rough Identity–Summand Graph of Filters of A Rough bi–Heyting Algebra Cover

Generation of Gray Codes Through the Rough Identity–Summand Graph of Filters of A Rough bi–Heyting Algebra

International Journal of Applied Mathematics and Computer Science
Volume 35 (2025): Issue 2 (June 2025)
By: Bashyam Praba and  Lourdusamy Packiammal Anto Freeda  
Open Access
|Jun 2025

Authors

Bashyam Praba

prabab@ssn.edu.in

Department of Mathematics, Sri Sivasubramaniya Nadar College of Engineering, Rajiv Gandhi Salai (OMR), Kalavakkam – 603 110 Chennai, India

Lourdusamy Packiammal Anto Freeda

Department of Mathematics, Sri Sivasubramaniya Nadar College of Engineering, Rajiv Gandhi Salai (OMR), Kalavakkam – 603 110 Chennai, India
DOI: https://doi.org/10.61822/amcs-2025-0026 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 371 - 385
Submitted on: Aug 2, 2024
Accepted on: Nov 7, 2024
Published on: Jun 24, 2025
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Heyting algebra,
filter,
identity-summand graph,
complete bipartite graph,
Gray code
Related subjects:
Mathematics,
Applied mathematics

© 2025 Bashyam Praba, Lourdusamy Packiammal Anto Freeda, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 35 (2025): Issue 2 (June 2025)