The unitary Cayley graph of upper triangular matrix rings

Abstract

The unitary Cayley graph CR of a finite unital ring R is the simple graph with vertex set R in which two elements x and y are connected by an edge if and only if x-y is a unit of R. We characterize the unitary Cayley graph CTn (F) of the ring of all upper triangular matrices Tn(F) over a finite field F. We show that CTn (F) is isomorphic to the semistrong product of the complete graph Km and the antipodal graph of the Hamming graph A(H(n,pk)), where m=pkn(n-1)2 and |F|=pk. In particular, if |F|=2, then the graph CTn (F) has 2n-1 connected components, each component is isomorphic to the complete bipartite graph Km,m, where m=2n(n-1)2. We also compute the diameter, triameter, and clique number of the graph CTn (F).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…