Akademska digitalna zbirka SLovenije - logo

Search results

Basic search    Advanced search   
Search
request
Library

Currently you are NOT authorised to access e-resources SI consortium. For full access, REGISTER.

1 2
hits: 20
1.
  • Cubic symmetric graphs of o... Cubic symmetric graphs of order a small number times a prime or a prime square
    Feng, Yan-Quan; Kwak, Jin Ho Journal of combinatorial theory. Series B, 07/2007, Volume: 97, Issue: 4
    Journal Article
    Peer reviewed
    Open access

    A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular elementary abelian coverings of the complete bipartite graph K 3 , 3 and the ...
Full text
Available for: GEOZS, IJS, IMTLJ, KILJ, KISLJ, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UILJ, UL, UM, UPCLJ, UPUK, ZAGLJ, ZRSKP

PDF
2.
  • A classification of cubic s... A classification of cubic s -regular graphs of order 14 p
    Oh, Ju-Mok Discrete mathematics, 05/2009, Volume: 309, Issue: 9
    Journal Article
    Peer reviewed
    Open access

    A graph is s - regular if its automorphism group acts regularly on the set of its s -arcs. In this paper, we classify the cubic s -regular cubic graphs of order 14 p for each s ≥ 1 and each prime p .
Full text
Available for: GEOZS, IJS, IMTLJ, KILJ, KISLJ, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UILJ, UL, UM, UPCLJ, UPUK, ZAGLJ, ZRSKP

PDF
3.
  • Cubic s-regular graphs of o... Cubic s-regular graphs of order 2p3
    Feng, Yan-Quan; Kwak, Jin Ho; Xu, Ming-Yao Journal of graph theory, 08/2006, Volume: 52, Issue: 4
    Journal Article
    Peer reviewed

    A graph is s‐regular if its automorphism group acts regularly on the set of its s‐arcs. Malnič et al. (Discrete Math 274 (2004), 187–198) classified the connected cubic edge‐transitive, but not ...
Full text
Available for: BFBNIB, FZAB, GIS, IJS, KILJ, NLZOH, NUK, OILJ, SBCE, SBMB, UL, UM, UPUK
4.
  • Cubic symmetric graphs of o... Cubic symmetric graphs of order twice an odd prime-power
    Feng, Yan-Quan; Kwak, Jin Ho Journal of the Australian Mathematical Society (2001), 10/2006, Volume: 81, Issue: 2
    Journal Article
    Peer reviewed
    Open access

    An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular. For a connected ...
Full text
Available for: NUK, UL

PDF
5.
  • s ‐Regular cubic graphs as ... s ‐Regular cubic graphs as coverings of the complete bipartite graph K 3,3
    Feng, Yan‐Quan; Kwak, Jin Ho Journal of graph theory, 02/2004, Volume: 45, Issue: 2
    Journal Article
    Peer reviewed

    Abstract A graph is s‐regular if its automorphism group acts freely and transitively on the set of s ‐arcs. An infinite family of cubic 1‐regular graphs was constructed in 10, as cyclic coverings of ...
Full text
Available for: BFBNIB, FZAB, GIS, IJS, KILJ, NLZOH, NUK, OILJ, SBCE, SBMB, UL, UM, UPUK
6.
  • s-Regular cyclic coverings ... s-Regular cyclic coverings of the three-dimensional hypercube Q3
    Feng, Yan-Quan; Wang, Kaishun European journal of combinatorics, 08/2003, Volume: 24, Issue: 6
    Journal Article
    Peer reviewed
    Open access

    A graph is s- regular if its automorphism group acts regularly on the set of s-arcs. An infinite family of cubic 1-regular graphs was constructed in European J. Combin. 23 (2002) 559, as cyclic ...
Full text
Available for: GEOZS, IJS, IMTLJ, KILJ, KISLJ, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UILJ, UL, UM, UPCLJ, UPUK, ZAGLJ, ZRSKP

PDF
7.
  • s-Regular cubic graphs as c... s-Regular cubic graphs as coverings of the complete bipartite graph K3,3
    Feng, Yan-Quan; Kwak, Jin Ho Journal of graph theory, 02/2004, Volume: 45, Issue: 2
    Journal Article
    Peer reviewed

    A graph is s‐regular if its automorphism group acts freely and transitively on the set of s‐arcs. An infinite family of cubic 1‐regular graphs was constructed in 10, as cyclic coverings of the ...
Full text
Available for: BFBNIB, FZAB, GIS, IJS, KILJ, NLZOH, NUK, OILJ, SBCE, SBMB, UL, UM, UPUK
8.
  • s-REGULAR DIHEDRAL COVERING... s-REGULAR DIHEDRAL COVERINGS OF THE COMPLETE GRAPH OF ORDER 4
    FENG, YANQUAN; KWAK, J. H. Chinese annals of mathematics. Serie B, 2004, 2004-01-00, Volume: 25, Issue: 1
    Journal Article
    Peer reviewed

    A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs.An infinite family of cubic 1-regular graphs was constructed in 7 as cyclic coverings of the three-dimensional ...
Full text
Available for: DOBA, EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, IZUM, KILJ, KISLJ, MFDPS, NLZOH, NUK, OILJ, PILJ, PNG, SAZU, SBCE, SBJE, UILJ, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
9.
  • On the structure of consist... On the structure of consistent cycles in cubic symmetric graphs
    Kutnar, Klavdija; Marušič, Dragan; Miklavič, Štefko ... Journal of graph theory, March 2024, 2024-03-00, 20240301, Volume: 105, Issue: 3
    Journal Article
    Peer reviewed
    Open access

    A cycle in a graph is consistent if the automorphism group of the graph admits a one‐step rotation of this cycle. A thorough description of consistent cycles of arc‐transitive subgroups in the full ...
Full text
Available for: BFBNIB, FZAB, GIS, IJS, KILJ, NLZOH, NUK, OILJ, SBCE, SBMB, UL, UM, UPUK
10.
  • Classifying cubic symmetric... Classifying cubic symmetric graphs of order 52p2; pp. 55–60
    Hao, S; Lin, S Proceedings of the Estonian Academy of Sciences, 02/2023, Volume: 72, Issue: 1
    Journal Article
    Peer reviewed
    Open access

    An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular. In this paper, we ...
Full text
Available for: DOBA, IZUM, KILJ, NUK, ODKLJ, PILJ, PNG, SAZU, UILJ, UKNU, UL, UM, UPUK
1 2
hits: 20

Load filters