Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Klavdija Kutnar"'
Publikováno v:
Journal of Algebraic Combinatorics. 55:1063-1083
A finite simple graph is called a k-multicirculant if its automorphism group contains a cyclic semiregular subgroup having k orbits on the vertex set. It was shown by Giudici et al. that, if k is squarefree and coprime to 6, then a cubic arc-transiti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d92cbbd98722959036604971674cd8de
https://doi.org/10.1007/s10801-021-01083-1
https://doi.org/10.1007/s10801-021-01083-1
Publikováno v:
Combinatorica. 41:507-543
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6736a3b96c105e6b014f0bd0af61bac3
https://doi.org/10.1007/s00493-020-4384-6
https://doi.org/10.1007/s00493-020-4384-6
Publikováno v:
Discrete Applied Mathematics. 298:34-49
Let l denote a non-negative integer. A connected graph Γ of even order at least 2 l + 2 is l -extendable if it contains a matching of size l and if every such matching is contained in a perfect matching of Γ . A regular graph Γ is co-edge-regular
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47329d33905c6ba3fd782ef4a1407614
https://doi.org/10.1016/j.dam.2021.03.018
https://doi.org/10.1016/j.dam.2021.03.018
Publikováno v:
Ars Mathematica Contemporanea. 19:1-15
A step forward is made in a long standing Lovasz problem regarding hamiltonicity of vertex-transitive graphs by showing that every connected vertex-transitive graph of order a product of two primes arising from the group action of the projective spec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48b6254fc982e4f37ca867c03d9c4a03
https://doi.org/10.26493/1855-3974.2163.5df
https://doi.org/10.26493/1855-3974.2163.5df
Publikováno v:
Journal of Algebraic Combinatorics. 53:881-895
Properties of symmetric cubic graphs are described via their rigid cells, which are maximal connected subgraphs fixed pointwise by some involutory automorphism of the graph. This paper completes the description of rigid cells and the corresponding in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ef45d789463c72650770545b357c887
https://doi.org/10.1007/s10801-020-00946-3
https://doi.org/10.1007/s10801-020-00946-3
Two elements $g$ and $h$ of a permutation group $G$ acting on a set $V$ are said to be intersecting if $g(v) = h(v)$ for some $v \in V$. More generally, a subset ${\cal F}$ of $G$ is an intersecting set if every pair of elements of ${\cal F}$ is inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6b9b06be000f79d3fe723cbc37f86f0
http://arxiv.org/abs/2107.09327
http://arxiv.org/abs/2107.09327
Publikováno v:
Applied Mathematics and Computation. 353:329-337
A non-trivial automorphism g of a graph Γ is called semiregular if the only power gi fixing a vertex is the identity mapping, and it is called quasi-semiregular if it fixes one vertex and the only power gi fixing another vertex is the identity mappi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef239599bfdaa478bc2bd693311a6ba1
https://doi.org/10.1016/j.amc.2019.01.048
https://doi.org/10.1016/j.amc.2019.01.048
Autor:
Dragan Marušič, Klavdija Kutnar
Publikováno v:
Journal of Combinatorial Theory, Series B. 136:170-192
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More precisely
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7645c0527903e18fc51fdd579d619b1
https://doi.org/10.1016/j.jctb.2018.10.003
https://doi.org/10.1016/j.jctb.2018.10.003
Autor:
Klavdija Kutnar, Dragan Marušič
Publikováno v:
Journal of Combinatorial Theory, Series A. 190:105639
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06a6a7dab2e9cccfd8149b41a7bdb17b
https://doi.org/10.1016/j.jcta.2022.105639
https://doi.org/10.1016/j.jcta.2022.105639
Publikováno v:
European Journal of Combinatorics. 103:103523
For a permutation group $G$ acting on a set $V$, a subset $I$ of $G$ is said to be an intersecting set if for every pair of elements $g,h\in I$ there exists $v \in V$ such that $g(v) = h(v)$. The intersection density $\rho(G)$ of a transitive permuta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99e483addd1f8b97184d14d2eced9867
https://doi.org/10.1016/j.ejc.2022.103523
https://doi.org/10.1016/j.ejc.2022.103523