An interesting property of a class of circulant graphs (Q2421751): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on integral graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with integral spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which Cayley graphs are integral? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4831098 / rank
 
Normal rank

Latest revision as of 13:10, 19 July 2024

scientific article
Language Label Description Also known as
English
An interesting property of a class of circulant graphs
scientific article

    Statements

    An interesting property of a class of circulant graphs (English)
    0 references
    0 references
    0 references
    18 June 2019
    0 references
    Summary: Suppose that \(\Pi = \mathrm{Cay}(\mathbb{Z}_n, \Omega)\) and \(\Lambda =\mathrm{Cay}(\mathbb{Z}_n, \Psi_m)\) are two Cayley graphs on the cyclic additive group \(\mathbb{Z}_n\), where \(n\) is an even integer, \(m=n/2+1\), \(\Omega =\left\{t \in \mathbb{Z}_n \mid t \text{ is odd}\right\}\), and \(\Psi_m =\Omega \cup \{n / 2 \}\) are the inverse-closed subsets of \(\mathbb{Z}_n - \{0\}\). In this paper, it is shown that \(\Pi\) is a distance-transitive graph, and, by this fact, we determine the adjacency matrix spectrum of \(\Pi\). Finally, we show that if \(n \geq 8\) and \(n/2\) is an even integer, then the adjacency matrix spectrum of \(\Lambda\) is \((n/2+1)^1\), \((1-n/2)^1\), \((1)^{(n-4)/2}\), \((-1)^{n/2}\) (we write multiplicities as exponents).
    0 references
    adjacency matrix spectrum
    0 references
    distance-transitive graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references