Zobrazeno 1 - 10
of 1 026
pro vyhledávání: '"05C78"'
Autor:
Licona, Miguel, Tey, Joaquín
It is known that if a plane graph is graceful (resp. near-graceful), then its semidual is conservative (resp. near-conservative). In this work we prove that the semidual of a plane graph of size $M$ consisting of two nested cycles is conservative if
Externí odkaz:
http://arxiv.org/abs/2411.12998
A graph $G$ is cordial if there exists a function $f$ from the vertices of $G$ to $\{0,1\}$ such that the number of vertices labelled $0$ and the number of vertices labelled $1$ differ by at most $1$, and if we assign to each edge $xy$ the label $|f(
Externí odkaz:
http://arxiv.org/abs/2411.04458
Autor:
Lau, Gee-Choon, Shiu, Wai Chee
It is known that null graphs and 1-regular graphs are the only regular graphs without local antimagic chromatic number. In this paper, we proved that the join of 1-regular graph and a null graph has local antimagic chromatic number is 3. Consequently
Externí odkaz:
http://arxiv.org/abs/2410.17674
A graph has a locating rainbow coloring if every pair of its vertices can be connected by a path passing through internal vertices with distinct colors and every vertex generates a unique rainbow code. The minimum number of colors needed for a graph
Externí odkaz:
http://arxiv.org/abs/2410.09304
Autor:
Mella, Lorenzo, Pasotti, Anita
In this paper we introduce a new domination problem strongly related to the following one recently proposed by Broe, Chartrand and Zhang. One says that a vertex $v$ of a graph $\Gamma$ labeled with an integer $\ell$ dominates the vertices of $\Gamma$
Externí odkaz:
http://arxiv.org/abs/2410.04782
Let $m,n,s,k$ be four integers such that $1\leqslant s \leqslant n$, $1\leqslant k\leqslant m$ and $ms=nk$. A signed magic array $SMA(m,n; s,k)$ is an $m\times n$ partially filled array whose entries belong to the subset $\Omega\subset \mathbb{Z}$, w
Externí odkaz:
http://arxiv.org/abs/2410.04101
The $\lambda$-backbone coloring of the graph $G$ with backbone $H$ is a graph-coloring problem in which we are given a graph $G$ and a subgraph $H$, and we want to assign colors to vertices in such a way that the endpoints of every edge from $G$ have
Externí odkaz:
http://arxiv.org/abs/2409.10201
We prove a conjecture of Graham and H\"aggkvist (1989), which states that any tree on $n$ edges decomposes the complete bipartite graph $K_{n,n}$. We do so by translating the decomposition problem into a labeling problem, namely $\vec{\beta}$-labelin
Externí odkaz:
http://arxiv.org/abs/2409.01981
Autor:
Bergold, Helena, Iršič, Vesna, Lauff, Robert, Orthaber, Joachim, Scheucher, Manfred, Wesolek, Alexandra
We show that there exists an outerplanar graph on $O(n^{c})$ vertices for $c = \log_2(3+\sqrt{10}) \approx 2.623$ that contains every tree on $n$ vertices as a subgraph. This extends a result of Chung and Graham from 1983 who showed that there exist
Externí odkaz:
http://arxiv.org/abs/2409.01678
Autor:
Beasley, LeRoy b.
An undirected graph is said to be cordial if there is a friendly (0,1)-labeling of the vertices that induces a friendly (0,1)-labeling of the edges. An undirected graph $G$ is said to be $(2,3)$-orientable if there exists a friendly (0,1)-labeling of
Externí odkaz:
http://arxiv.org/abs/2408.13853