The Structure of Orthomorphism Graph of $(\mathbb{Z}_2 \times \mathbb{Z}_4)$
Rohitesh Pradhan, Vivek Kumar Jain
TL;DR
This paper provides a theoretical proof that the orthomorphism graph of the group Z2 x Z4 has a maximum clique size of 2 by analyzing its structure.
Contribution
It determines the structure of the orthomorphism graph of Z2 x Z4 and proves its maximal clique size, advancing understanding of its combinatorial properties.
Findings
Orthomorphism graph of Z2 x Z4 has maximal clique size 2
Structural analysis of the orthomorphism graph
Theoretical proof of clique size property
Abstract
In this paper, we gave a theoretical proof of the fact that Orthomorphism graph of group has maximal clique 2, by determining the structure of the graph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Finite Group Theory Research · Advanced Graph Theory Research