Distinguishing Trees in Linear Time
نویسندگان
چکیده
4 A graph is said to be d-distinguishable if there exists a d-labeling of its vertices which is 5 only preserved by the identity map. The distinguishing number of a graph G is the smallest 6 number d for which G is d-distinguishable. We show that the distinguishing number of trees 7 and forests can be computed in linear time, improving the previously known O(n log n) time 8 algorithm. 9
منابع مشابه
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...
متن کاملAn Exploration of Graph Based Approaches in Data Stream Mining
Progressive advancements in the data stream mining have paved way for many algorithms to solve the problem of concept drift, a serious problem due to the wavering nature of the real time concepts. Concepts tend to change with time therefore concept drift is unavoidable in data stream mining but efficient algorithms can be designed to detect the concept drift and solve the problem. This paper pr...
متن کاملComputational capabilities of linear recursive networks
Recursive neural networks are a new connec-tionist model recently introduced for processing graphs. Linear recursive networks are a special sub-class where the neurons have linear activation functions. The approximation properties of recursive networks are tightly connected to the possibility of distinguishing the patterns by generating a different internal encoding for each input of the domain...
متن کاملOn the extremal total irregularity index of n-vertex trees with fixed maximum degree
In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...
متن کاملThe Distinguishing Chromatic Number
In this paper we define and study the distinguishing chromatic number, χD(G), of a graph G, building on the work of Albertson and Collins who studied the distinguishing number. We find χD(G) for various families of graphs and characterize those graphs with χD(G) = |V (G)|, and those trees with the maximum chromatic distingushing number for trees. We prove analogs of Brooks’ Theorem for both the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012