VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • I-graphs and the corresponding configurations
    Boben, Marko ; Pisanski, Tomaž ; Žitnik, Arjana
    We consider the class of I-graphs ▫$I(n,j,k)$▫, which is a generalization over the class of generalized Petersen graphs. We study different properties of I-graphs such as connectedness, girth and ... whether they are bipartite or vertex-transitive. We give an efficient test for isomorphism of I-graphs and characterize the automorphism groups of I-graphs. Regular bipartite graphs with girth at least 6 can be considered as Levi graphs of some symmetric combinatorial configurations. We consider configurations which arise from bipartite I-graphs. Some of them can be realized in the plane as cyclic astral configurations, i.e. as geometric configurations with maximal isometric symmetry.
    Vir: Preprint series. - ISSN 1318-4865 (Vol. 42, št. 939, 2004, str. 1-17)
    Vrsta gradiva - članek, sestavni del
    Leto - 2004
    Jezik - angleški
    COBISS.SI-ID - 13249625

vir: Preprint series. - ISSN 1318-4865 (Vol. 42, št. 939, 2004, str. 1-17)
loading ...
loading ...
loading ...

Vnos na polico