Zobrazeno 1 - 10
of 19
pro vyhledávání: '"05C78, 05C85"'
Autor:
Alekseyev, Max A.
We address the problem of finding sets of integers of a given size with maximum number of pairs summing to powers of $2$. By fixing particular pairs this problem reduces to finding a labeling of the vertices of a given graph with pairwise distinct in
Externí odkaz:
http://arxiv.org/abs/2303.02872
In this paper we analyze and model three open problems posed by Harris, Insko, Prieto-Langarica, Stoisavljevic, and Sullivan in 2020 concerning the tipsy cop and robber game on graphs. The three different scenarios we model account for different biol
Externí odkaz:
http://arxiv.org/abs/2102.13532
Motivated by a biological scenario illustrated in the YouTube video \url{ https://www.youtube.com/watch?v=Z_mXDvZQ6dU} where a neutrophil chases a bacteria cell moving in random directions, we present a variant of the cop and robber game on graphs ca
Externí odkaz:
http://arxiv.org/abs/2004.00606
Autor:
Yetim, Mehmet Akif
Publikováno v:
Discussiones Mathematicae Graph Theory 43(4) (2023) 1215-1235
We provide upper bounds on the $L(p,q)$-labeling number of graphs which have interval (or circular-arc) representations via simple greedy algorithms. We prove that there exists an $L(p,q)$-labeling with span at most $\max\{2(p+q-1)\Delta-4q+2, (2p-1)
Externí odkaz:
http://arxiv.org/abs/1909.05425
Autor:
Diaz-Lopez, Alexander, Everham, Lucas, Harris, Pamela E., Insko, Erik, Marcantonio, Vincent, Omar, Mohamed
Given a graph $G$ with $n$ vertices and a bijective labeling of the vertices using the integers $1,2,\ldots, n$, we say $G$ has a peak at vertex $v$ if the degree of $v$ is greater than or equal to 2, and if the label on $v$ is larger than the label
Externí odkaz:
http://arxiv.org/abs/1708.08493
The positive zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring, and is related to a more conventional version of zero forcing. We establish a relation between the zero forcing and the fast-
Externí odkaz:
http://arxiv.org/abs/1407.7017
Autor:
Adjiashvili, David, Rotbart, Noy
We investigate adjacency labeling schemes for graphs of bounded degree $\Delta = O(1)$. In particular, we present an optimal (up to an additive constant) $\log n + O(1)$ adjacency labeling scheme for bounded degree trees. The latter scheme is derived
Externí odkaz:
http://arxiv.org/abs/1404.0588
Publikováno v:
Journal of Combinatorial Optimisation 21(1):19-46(2011)
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of ever
Externí odkaz:
http://arxiv.org/abs/0811.4713
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest integer k for which G has a distinguishing k-labeling. In this paper,
Externí odkaz:
http://arxiv.org/abs/math/0703927
Publikováno v:
Advances and Applications in Discrete Mathematics. 27:39-72
Motivated by a biological scenario illustrated in the YouTube video \url{ https://www.youtube.com/watch?v=Z_mXDvZQ6dU} where a neutrophil chases a bacteria cell moving in random directions, we present a variant of the cop and robber game on graphs ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5cda38c3de92fb82a2608fb6aa9dccc
https://doi.org/10.17654/dm027010039
https://doi.org/10.17654/dm027010039
