Constructions of self-complementary circulants with no multiplicative isomorphisms (Q5952155): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1006/eujc.2001.0529 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/eujc.2001.0529 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993394072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of selfcomplementary circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the full automorphism group of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On isomorphisms of connected Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2761045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-complementary vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-complementary strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Cayley vertex-transitive graphs of order twice the product of two odd primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ádám's conjecture is true in the square-free case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regular and strongly-regular self-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5730676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point-symmetric graphs with a prime number of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-complementary symmetric graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/EUJC.2001.0529 / rank
 
Normal rank

Latest revision as of 12:19, 9 December 2024

scientific article; zbMATH DE number 1687778
Language Label Description Also known as
English
Constructions of self-complementary circulants with no multiplicative isomorphisms
scientific article; zbMATH DE number 1687778

    Statements

    Constructions of self-complementary circulants with no multiplicative isomorphisms (English)
    0 references
    0 references
    0 references
    3 June 2002
    0 references
    For a finite group \(G\), let \(G^{\#} = G\setminus \{1\} \), the set of all non-identity elements of \(G\). For a set \(S\subseteq G^{\#}\), \(\text{Cay}(G,S)\) is the associated Cayley graph. If \(G\) is cyclic, then \(\text{Cay}(G,S)\) is called a circulant. Let \(\sigma \) be an element of the group of automorphisms of \(G\). A self-complementary Cayley graph \(\text{Cay}(G,S)\) is an SCI-graph (here SCI stands for Self-complementary Cayley Isomorphism) of \(G\) if \(S^{\sigma} = G^{\#}\setminus S\) for some \(\sigma \in \text{Aut}(G)\). The question of the existence of self-complementary Cayley graphs that are not SCI-graphs is answered in the positive. Infinite families of such graphs are constructed. All primes \(p\) for which there exist self-complementary circulants of order \(p^2\) which are not SCI-graphs are also characterized.
    0 references
    self-complementary graphs
    0 references
    circulant graphs
    0 references
    Cayley graph
    0 references

    Identifiers