Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Ademir Hujdurović"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 20 no. 2, Iss Graph Theory (2018)
We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-covered can be measured by its independence gap, defined as the differen
Externí odkaz:
https://doaj.org/article/3906dc372a2a49a58ebd9262d6953c2c
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 1, Iss Graph Theory (2017)
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class of well-co
Externí odkaz:
https://doaj.org/article/76992a11f7b44801ba9a966ad98920bc
Publikováno v:
Journal of Graph Theory. 99:207-216
It is known that there are precisely three transitive permutation groups of degree $6$ that admit an invariant partition with three parts of size $2$ such that the kernel of the action on the parts has order $4$; these groups are called $A_4(6)$, $S_
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a1ae8e297db02a5023bedb4d0040fc5
https://doi.org/10.1002/jgt.22735
https://doi.org/10.1002/jgt.22735
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
Autor:
Ademir Hujdurović
Publikováno v:
Journal of Graph Theory. 95:543-564
A clique (resp., independent set) in a graph is strong if it intersects every maximal independent sets (resp., every maximal cliques). A graph is CIS if all of its maximal cliques are strong and localizable if it admits a partition of its vertex set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1cef8bb612e3150f3172b3e929a25872
https://doi.org/10.1002/jgt.22573
https://doi.org/10.1002/jgt.22573
A graph $X$ is said to be "unstable" if the direct product $X \times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is "nontrivially unstable" if it is unsta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c00e365818af42830a49fbfd559cebfd
http://arxiv.org/abs/2108.05893
http://arxiv.org/abs/2108.05893
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
Autor:
Ademir Hujdurović
Publikováno v:
Discrete Mathematics. 342:2542-2548
A canonical double cover B ( X ) of a graph X is the direct product of X and the complete graph K 2 on two vertices. In order to answer the question when a canonical double cover of a given graph is a Cayley graph, in 1992 Marusic et al. introduced t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f26e956e2dffc92e1269ed73eb57ab3f
https://doi.org/10.1016/j.disc.2019.05.018
https://doi.org/10.1016/j.disc.2019.05.018
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