Analytical enumeration of circulant graphs with prime-squared number of vertices.

Klin, Mikhail; Liskovets, Valery; Pöschel, Reinhard

Séminaire Lotharingien de Combinatoire [electronic only] (1996)

  • Volume: 36, page B36d, 36 p.-B36d, 36 p.
  • ISSN: 1286-4889

How to cite

top

Klin, Mikhail, Liskovets, Valery, and Pöschel, Reinhard. "Analytical enumeration of circulant graphs with prime-squared number of vertices.." Séminaire Lotharingien de Combinatoire [electronic only] 36 (1996): B36d, 36 p.-B36d, 36 p.. <http://eudml.org/doc/119303>.

@article{Klin1996,
author = {Klin, Mikhail, Liskovets, Valery, Pöschel, Reinhard},
journal = {Séminaire Lotharingien de Combinatoire [electronic only]},
keywords = {enumeriation of circulant graphs; generating functions; tournaments},
language = {eng},
pages = {B36d, 36 p.-B36d, 36 p.},
publisher = {Universität Wien, Fakultät für Mathematik},
title = {Analytical enumeration of circulant graphs with prime-squared number of vertices.},
url = {http://eudml.org/doc/119303},
volume = {36},
year = {1996},
}

TY - JOUR
AU - Klin, Mikhail
AU - Liskovets, Valery
AU - Pöschel, Reinhard
TI - Analytical enumeration of circulant graphs with prime-squared number of vertices.
JO - Séminaire Lotharingien de Combinatoire [electronic only]
PY - 1996
PB - Universität Wien, Fakultät für Mathematik
VL - 36
SP - B36d, 36 p.
EP - B36d, 36 p.
LA - eng
KW - enumeriation of circulant graphs; generating functions; tournaments
UR - http://eudml.org/doc/119303
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.