Isomorphism testing for circulant graphs C_n(a,b) (Articolo in rivista)

Type
Label
  • Isomorphism testing for circulant graphs C_n(a,b) (Articolo in rivista) (literal)
Anno
  • 2012-01-01T00:00:00+01:00 (literal)
Alternative label
  • NICOLOSO Sara; PIETROPAOLI Ugo (2012)
    Isomorphism testing for circulant graphs C_n(a,b)
    in Utilitas mathematica
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • NICOLOSO Sara; PIETROPAOLI Ugo (literal)
Pagina inizio
  • 165 (literal)
Pagina fine
  • 182 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 87 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 18 (literal)
Note
  • Scopu (literal)
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • NICOLOSO Sara, IASI-CNR; PIETROPAOLI Ugo, Università di Roma Tor Vergata (literal)
Titolo
  • Isomorphism testing for circulant graphs C_n(a,b) (literal)
Abstract
  • In this paper we focus on connected directed/undirected circulant graphs $C_n(a,b)$. We investigate some topological characteristics, and define a simple combinatorial model, which is new for the topic. Building on such a model, we derive a necessary and sufficient condition to test whether two circulant graphs $C_n(a,b)$ and $C_n(a',b')$ are isomorphic or not. The method is entirely elementary and consists of comparing two suitably computed integers in $\{1, \dots, \frac{n}{\gcd(n,a)\gcd(n,b)}-1\}$, and of verifying if $\{\gcd(n,a),\gcd(n,b)\}=\{\gcd(n,a'),\gcd(n,b')\}$. It also allows for building the mapping function in linear time. In addition, properties of the classes of mutually isomorphic graphs are analyzed. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Autore CNR di
Prodotto
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Insieme di parole chiave di
data.CNR.it