All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F20%3A43958598" target="_blank" >RIV/49777513:23520/20:43958598 - isvavai.cz</a>

  • Result on the web

    <a href="http://copus.com/record/display.uri?eid=2-s2.0-85079093953&origin=resultslist&sort=plf-f&src=s&st1=Nedela&nlo=&nlr=&nls=&sid=d86c3b2eb8518c7a6cba6d5afada94a5&sot=b&sdt=cl&cluster=scoprefnameauid%2c"Nedela%2c+R.%236602818470"%2ct&sl=19&s=AUTHOR-NAME%28Nedela%29&relpos=0&citeCnt=0&searchTerm=" target="_blank" >http://copus.com/record/display.uri?eid=2-s2.0-85079093953&origin=resultslist&sort=plf-f&src=s&st1=Nedela&nlo=&nlr=&nls=&sid=d86c3b2eb8518c7a6cba6d5afada94a5&sot=b&sdt=cl&cluster=scoprefnameauid%2c"Nedela%2c+R.%236602818470"%2ct&sl=19&s=AUTHOR-NAME%28Nedela%29&relpos=0&citeCnt=0&searchTerm=</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-32808-5_7" target="_blank" >10.1007/978-3-030-32808-5_7</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time

  • Original language description

    We construct a polynomial-time algorithm that, for a graph X with 4p We construct a polynomial-time algorithm that for a graph X with 4p vertices (p is prime), finds (if any) a Cayley representation of X over the group C2 × C2 × Cp. This result, together with the known similar result for circulant graphs, shows that recognizing and testing isomorphism of Cayley graphs over an abelian group of order 4p can be done in polynomial time

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10101 - Pure mathematics

Result continuities

  • Project

    <a href="/en/project/LO1506" target="_blank" >LO1506: Sustainability support of the centre NTIS - New Technologies for the Information Society</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2020

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Isomorphisms, Symmetry and Computations in Algebraic Graph Theory

  • ISBN

    978-3-030-32807-8

  • ISSN

    2194-1009

  • e-ISSN

    2194-1017

  • Number of pages

    24

  • Pages from-to

    195-218

  • Publisher name

    Springer

  • Place of publication

    Heidelberg

  • Event location

    Plzeň

  • Event date

    Oct 3, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article