Muutke küpsiste eelistusi

E-raamat: Isomorphisms, Symmetry and Computations in Algebraic Graph Theory: Pilsen, Czech Republic, October 3-7, 2016

Edited by , Edited by , Edited by
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 159,93 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book consists of a selection of peer-reviewed contributions to the Workshop on Algebraic Graph Theory that took place in Pilsen, Czech Republic in October 2016. Primarily intended for early career researchers, it presents eight self-contained articles on a selection of topics within algebraic combinatorics, ranging from association schemes to symmetries of graphs and isomorphism testing. Algebraic combinatorics is a compelling mathematical discipline based on the powerful interplay of algebraic and combinatorial methods. Algebraic interpretation of combinatorial structures (such as symmetry or regularity) has often led to enlightening discoveries and powerful results, while discrete and combinatorial structures have given rise to new algebraic structures that have found valuable applications.   

In addition to these original research contributions, the reader will find a survey linking numerous threads in algebraic combinatorics, and an extensive tutorial showcasing the universality of algebraic methods in the study of combinatorial structures.


G. Erskine, K. Hriáková, J. irá, Orientably-regular maps on twisted
linear fractional groups.- V. Gatt, M. Klin, J. Lauri, V. Liskovets, From
Schur rings to constructive and analytical enumeration of circulant graphs
with prime-cubed number of vertices.- . Gyürki, A note on a problem of L.
Martnez on almost-uniform partial sum families.- . Gyürki, M. Klin, M.
Ziv-Av, The Paulus-Rozenfeld-Thompson graph on 26 vertices revisited and
related combinatorial structures.- G. A. Jones, Paley and the Paley graphs.-
M. E. Muzychuk, Automorphism groups of Paley graphs and cyclotomic schemes.-
R. Nedela, I. Ponomarenko, Recognizing and testing isomorphism of
Cayley graphs over an abelian group of order 4p in polynomial time.- S.
Reichard, Tatra schemes and their mergings.