Some properties of unitary Cayley graphs (Q2372889): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import IPFS CIDs
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / IPFS content identifier
 
Property / IPFS content identifier: bafkreignafbtesqrb5jevidla7rwqzqgzofokpdj2es5br5w7iug2ptwue / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:21, 22 February 2025

scientific article
Language Label Description Also known as
English
Some properties of unitary Cayley graphs
scientific article

    Statements

    Some properties of unitary Cayley graphs (English)
    0 references
    0 references
    0 references
    16 July 2007
    0 references
    Summary: The unitary Cayley graph \(X_n\) has vertex set \(Z_n=\{0,1, \dots ,n-1\}\). Vertices \(a,~b\) are adjacent, if gcd\((a-b,n)=1\). For \(X_n\), the chromatic number, the clique number, the independence number, the diameter and the vertex connectivity are determined. We decide on the perfectness of \(X_n\) and show that all nonzero eigenvalues of \(X_n\) are integers dividing the value \(\varphi(n)\) of the Euler function.
    0 references
    chromatic number
    0 references
    clique number
    0 references
    independence number
    0 references
    diameter
    0 references
    connectivity
    0 references

    Identifiers