Characterization of rough identity-summand graph

DOI10.1142/S1793557125400236MaRDI QIDQ7228535zbMATH OpenFDO

Authors Bashyam Praba, L. P. Anto Freeda

Publication date 14 April 2026

Published in Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793557125400236

zbMATH Keywords

bi-Heyting algebracomplete bipartite graphgray codeidentity-summand graph

Mathematics Subject Classification ID

Heyting algebras (lattice-theoretic aspects) (06D20)

Cites work

• A construction of Gray codes inducing complete graphs
• An algebraic approach to non-classical logics
• Generation of gray codes through the rough identity-summand graph of filters of a rough bi-Heyting algebra
• Graphs induced by Gray codes
• scientific article; zbMATH DE number 3501559 (Why is no real title available?)
• scientific article; zbMATH DE number 7684688 (Why is no real title available?)
• Rough sets
• Some classes of bipartite graphs induced by Gray codes
• Some theorems about the sentential calculi of Lewis and Heyting

This page was built for publication: Characterization of rough identity-summand graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228535)