Atnaujinkite slapukų nuostatas

Isomorphisms, Symmetry and Computations in Algebraic Graph Theory: Pilsen, Czech Republic, October 37, 2016 2020 ed. [Kietas viršelis]

Edited by , Edited by , Edited by
  • Formatas: Hardback, 234 pages, aukštis x plotis: 235x155 mm, weight: 625 g, 5 Illustrations, color; 46 Illustrations, black and white; IX, 234 p. 51 illus., 5 illus. in color., 1 Hardback
  • Serija: Springer Proceedings in Mathematics & Statistics 305
  • Išleidimo metai: 07-Feb-2020
  • Leidėjas: Springer Nature Switzerland AG
  • ISBN-10: 3030328074
  • ISBN-13: 9783030328078
Kitos knygos pagal šią temą:
  • Formatas: Hardback, 234 pages, aukštis x plotis: 235x155 mm, weight: 625 g, 5 Illustrations, color; 46 Illustrations, black and white; IX, 234 p. 51 illus., 5 illus. in color., 1 Hardback
  • Serija: Springer Proceedings in Mathematics & Statistics 305
  • Išleidimo metai: 07-Feb-2020
  • Leidėjas: Springer Nature Switzerland AG
  • ISBN-10: 3030328074
  • ISBN-13: 9783030328078
Kitos knygos pagal šią temą:

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.