VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • The Ljubljana graph
    Conder, Marston D. E. ...
    A detailed description is given of a recently discovered edge-transitive but not vertex-transitive trivalent graph on 112 vertices, which turns out to be the third smallest example of such a ... semisymmetric graph. This graph is called the Ljubljana graph by the authors, although it is believed that its existence may have been known by R. M. Foster. With the help of some advanced theory of covering graphs, various properties of this graph are analysed, including a connection with the Heawood graph which can be described using ideals over polynomial rings.
    Vir: Preprint series. - ISSN 1318-4865 (Vol. 40, št. 845, 2002, str. 1-15)
    Vrsta gradiva - članek, sestavni del
    Leto - 2002
    Jezik - angleški
    COBISS.SI-ID - 12107353

vir: Preprint series. - ISSN 1318-4865 (Vol. 40, št. 845, 2002, str. 1-15)
loading ...
loading ...
loading ...