Zobrazeno 1 - 10
of 185
pro vyhledávání: '"Cichacz Sylwia"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 4, Pp 1021-1040 (2021)
Hovey introduced A-cordial labelings as a generalization of cordial and harmonious labelings [7]. If A is an Abelian group, then a labeling f : V (G) → A of the vertices of some graph G induces an edge labeling on G; the edge uv receives the label
Externí odkaz:
https://doaj.org/article/4612c9bbd67143738842c752e7ec4989
Autor:
Cichacz, Sylwia
We provide a summary of research on disjoint zero-sum subsets in finite Abelian groups, which is a branch of additive group theory and combinatorial number theory. An orthomorphism of a group $\Gamma$ is defined as a bijection $\varphi$ $\Gamma$ such
Externí odkaz:
http://arxiv.org/abs/2410.22245
Autor:
Cichacz, Sylwia
If $A$ is a finite Abelian group, then a labeling $f \colon E (G) \rightarrow A$ of the edges of some graph $G$ induces a vertex labeling on $G$; the vertex $u$ receives the label $\sum_{v\in N(u)}f (v)$, where $N(u)$ is an open neighborhood of the v
Externí odkaz:
http://arxiv.org/abs/2409.09136
Autor:
Cichacz, Sylwia
A complete mapping of a group $\Gamma$ is a bijection $\varphi\colon \Gamma\to \Gamma$ for which the mapping $x \mapsto x+\varphi(x)$ is a bijection. In this paper we consider the existence of a complete mapping $\varphi$ of $\Gamma$ and a partition
Externí odkaz:
http://arxiv.org/abs/2408.07411
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 2, Pp 533-546 (2019)
Let G = (V, E) be a graph of order n. A distance magic labeling of G is a bijection ℓ: V → {1, 2, . . ., n} for which there exists a positive integer k such that ∑x∈N(v)ℓ(x) = k for all v ∈ V, where N(v) is the open neighborhood of v.
Externí odkaz:
https://doaj.org/article/d87764b1c65947929cadfa55990c1f5b
Publikováno v:
Open Mathematics, Vol 16, Iss 1, Pp 154-160 (2018)
We investigate the group irregularity strength (sg(G)) of graphs, i.e. the smallest value of s such that taking any Abelian group 𝓖 of order s, there exists a function f : E(G) → 𝓖 such that the sums of edge labels at every vertex are distinc
Externí odkaz:
https://doaj.org/article/8bdb7d947a8c41d9bac2dc720d9b27f0
Autor:
Cichacz Sylwia, Gőrlich Agnieszka
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 1, Pp 97-106 (2018)
Let A = {1, 2, . . . , tm+tn}. We shall say that A has the (m, n, t)-balanced constant-sum-partition property ((m, n, t)-BCSP-property) if there exists a partition of A into 2t pairwise disjoint subsets A1, A2, . . . , At, B1, B2, . . . , Bt such tha
Externí odkaz:
https://doaj.org/article/f6034f70eebc457688655ad61d3aa083
Autor:
Cichacz, Sylwia, Dzúrik, Martin
In this paper we would like to introduce some new methods for studying magic type-colorings of graphs or domination of graphs, based on combinatorial spectrum on polynomial rings. We hope that this concept will be potentially useful for the graph the
Externí odkaz:
http://arxiv.org/abs/2401.01680
Autor:
Cichacz Sylwia, Nikodem Mateusz
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 1, Pp 239-249 (2017)
A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that the weight w(x) = ∑y∈NG(x) ℓ(y) of every vertex x ∈ V is equal to the same element μ, called the magic constant. In th
Externí odkaz:
https://doaj.org/article/c80e75c823624df8b542177ca44ae501
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 2, Pp 299-308 (2016)
A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant.
Externí odkaz:
https://doaj.org/article/e8799f7e78f045118123d0698de13311