Roughness in $G$-graphs

DOI10.14712/1213-7243.2020.016OpenAlexW3095250540MaRDI QIDQ5140417

B. N. Onagh

Publication date: 15 December 2020

Published in: Commentationes Mathematicae Universitatis Carolinae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14712/1213-7243.2020.016

zbMATH Keywords

grouprough setnormal subgroupcosetlower approximationupper approximation\(G\)-graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Applications of set theory (03E75) Set theory (03E99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cayley graphs and \(G\)-graphs: some applications
• G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
• Roughness in Cayley graphs
• The lower and upper approximations in a fuzzy group
• \(G\)-graphs: a new representation of groups
• Notes on ``The lower and upper approximations in a fuzzy group and ``Rough ideals in semigroups.
• A New Property of Hamming Graphs and Mesh of d-ary Trees
• Rough sets
• On constructing expander families of G-graphs

This page was built for publication: Roughness in $G$-graphs