References
- Atani, S.E., Hesari, S.D.P. and Khoramdel, M. (2014). The identity-summand graph of commutative semirings, Journal of the Korean Mathematical Society 51(1): 189–202.
- Atani, S.E., Hesari, S.D.P. and Khoramdel, M. (2015a). Total identity-summand graph of a commutative semiring with respect to a co-ideal, Journal of the Korean Mathematical Society 52(1): 159–176.
- Atani, S.E., Hesari, S.D.P., Khoramdel, M. and Sedghi, M. (2018). A semiprime filter-based identity-summand graph of a lattice, Le Matematiche 73(2): 297–318.
- Atani, S.E., Hesari, S. and Khoramdel, M. (2015b). A co-ideal based identity-summand graph of a commutative semiring, Commentationes Mathematicae Universitatis Carolinae 56(3): 269–285.
- Bondy, J.A. and Murthy, U.S.R. (1976). Graph Theory with Applications, London.
- Chandrasekaran, V., Manimaran, A. and Praba, B. (2017). Ideals of a commutative rough semiring, Bulletin of the Transilvania University of Brasov. Series III: Mathematics and Computer Science 10(59)(1): 67–82.
- Ebrahimi Atani, S., Khoramdel, M., Dolati Pish Hesari, S. and Nikmard Rostamalipour, M. (2023). A graph associated to filters of a lattice, Journal of Algebraic Systems 10(2): 345–359.
- Gallardo, C., Pelaitay, G. and Gallardo, C.S. (2023). T-rough symmetric heyting algebras with tense operators, Fuzzy Sets and Systems 466(16): 108455.
- Halmos, P. and Givant, S. (2009). Introduction to Boolean Algebras, Springer, New York.
- Liu, J.-B., Bao, Y., Zheng, W.-T. and Hayat, S. (2021). Network coherence analysis on a family of nested weighted n-polygon networks, Fractals 29(08): 2150260.
- Liu, J.-B. and Pan, X.-F. (2016). Minimizing Kirchhoff index among graphs with a given vertex bipartiteness, Applied Mathematics and Computation 291(20): 84–88.
- Liu, J.-B., Wang, X. and Cao, J. (2024). The coherence and properties analysis of balanced 2p-ary tree networks, IEEE Transactions on Network Science and Engineering.
- Manimaran, A., Praba, B. and Chandrasekaran, V. (2017). Characterization of rough semiring, Afrika Matematika 28(5): 945–956.
- Pawlak, Z. (1982). Rough sets, International Journal of Computer & Information Sciences 11(5): 341–356.
- Praba, B., Chandrasekaran, V. and Manimaran, A. (2015). Semiring on rough sets, Indian Journal of Science and Technology 8(3): 280–286.
- Praba, B. and Freeda, A. (2022). Rough bi-Heyting algebra and its applications in Heyting-Brouwer logic, submitted.
- Praba, B., Manimaran, A., Deepa, G. and Muchtadi-Alamsyah, I. (2025). A note on principal rough ideals of a rough monoid, Advances inMathematics: Scientific Journal 9(9): 6855–6861.
- Praba, B. and Mohan, R. (2013). Rough lattice, International Journal of Fuzzy Mathematics and System 3(2): 135–151.
- SanJuan, E. (2008). Heyting algebras with Boolean operators for rough sets and information retrieval applications, Discrete Applied Mathematics 156(6): 967–983.
- Suparta, I.N. (2017). Some classes of bipartite graphs induced by gray codes, Electronic Journal of Graph Theory and Applications 5(2): 312–324.
- Suparta, I.N. and Van Zanten, A. (2008). A construction of gray codes inducing complete graphs, Discrete Mathematics 308(18): 4124–4132.
- West, D.B. (2001). Introduction to Graph Theory, Vol. 2, Prentice Hall Upper Saddle River.
- Wilmer, E.L. and Ernst, M.D. (2002). Graphs induced by Gray codes, Discrete Mathematics 257(2-3): 585–598.
- Yao, Y. (1998). Constructive and algebraic methods of the theory of rough sets, Information Sciences 109(1–4): 21–47.