Local Distinguishing Numbers of Trees
نویسنده
چکیده
The i-local distinguishing number of G, denoted by LD i (G), was deened in 3]. Let T be a tree on n > 2 vertices with maximum degree bounded by some constant k. It is shown that LD 1 (T) = O(p n) and that for some trees this bound is tight. The result is extended to show that LD i (T) = O(n 1=(i+1)).
منابع مشابه
On Computing the Distinguishing Numbers of Trees and Forests
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum number of labels needed so that G has a distinguishing labeling. In this paper, we present O(n log n)-time algorithms that compute the distinguishing numbers of trees and forests. Unlike most of the previous work in t...
متن کاملSymmetry Breaking in Trees and Planar Graphs by Vertex Coloring
An undirected graph G is said to be d-distinguishable if there is a d-coloring of its vertex set V (G) such that no nontrivial automorphism of G preserves the coloring. The distinguishing number of a graph G is the minimum d for which it is d-distinguishable. In this paper we design efficient algorithms for computing the distinguishing numbers of trees and planar graphs.
متن کاملShapes of tree representations of spin-glass landscapes
Much of the information about the multi-valley structure of disordered spin systems can be convened in a simple tree structure – a barrier tree – the leaves and internal nodes of which represent, respectively, the local minima and the lowest energy saddles connecting those minima. Here we apply several statistics used in the study of phylogenetic trees to barrier trees that result from the ener...
متن کاملThe Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملA characterization of trees with equal Roman 2-domination and Roman domination numbers
Given a graph $G=(V,E)$ and a vertex $v in V$, by $N(v)$ we represent the open neighbourhood of $v$. Let $f:Vrightarrow {0,1,2}$ be a function on $G$. The weight of $f$ is $omega(f)=sum_{vin V}f(v)$ and let $V_i={vin V colon f(v)=i}$, for $i=0,1,2$. The function $f$ is said to bebegin{itemize}item a Roman ${2}$-dominating function, if for every vertex $vin V_0$, $sum_{uin N(v)}f(u)geq 2$. The R...
متن کامل