Roughness in G-graphs

DOI10.14712/1213-7243.2020.016MaRDI QIDQ5140417zbMATH OpenOpenAlexFDO

Authors 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

\(G\)-graphcosetgrouplower approximationnormal subgrouprough setupper approximation

Mathematics Subject Classification ID

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

Recommendations

• On \(G\)-graphs of certain finite groups
• \(G\)-graphs: a new representation of groups
• Symmetry and connectivity in G-graphs
• About some robustness and complexity properties of G-graphs networks
• Roughness in Cayley graphs

Cites work

• G-graphs for the cage problem: a new upper bound
• \(G\)-graphs: a new representation of groups
• A New Property of Hamming Graphs and Mesh of d-ary Trees
• Cayley graphs and G-graphs: some applications
• G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
• scientific article; zbMATH DE number 2185572 (Why is no real title available?)
• scientific article; zbMATH DE number 2200042 (Why is no real title available?)
• Notes on ``The lower and upper approximations in a fuzzy group and ``Rough ideals in semigroups.
• On constructing expander families of G-graphs
• Rough sets
• Roughness in Cayley graphs
• The lower and upper approximations in a fuzzy group

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

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