On the dimension of vertex labeling of $k$-uniform dcsl of $k$-uniform caterpillar
نویسندگان
چکیده
منابع مشابه
A Characterization of k-Uniform DCSL Graphs
Let an injective function f : V (G) → 2X, where V (G) is the vertex set of a graph G and 2X is the power set of a nonempty set X, be given. Consider the induced function f ⊕ : V (G) × V (G) → {Φ} defined by f⊕ (u, v) = f(u) ⊕ f(v), where f(u) ⊕ f(v) denotes the symmetric difference of the two sets. The function f is called a k-uniform dcsl (and X a k-uniform dcsl-set) of the graph G, if there e...
متن کاملCharacterization of Vertex labeling of 1- uniform dcsl graph which form a lattice
A 1-uniform dcsl of a graph G is an injective set-valued function f : V (G) → 2X , X be a non-empty ground set, such that the corresponding induced function f⊕ : V (G)×V (G) → 2X \ {φ} satisfies | f⊕(u,v)| = 1.d(u,v) for all distinct u,v ∈ V (G), where d(u,v) is the distance between u and v. Let F be a family of subsets of a set X . A tight path between two distinct sets P and Q (or from P to Q...
متن کاملOn the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex cover is polynomial time solvable. In this work, we study the natural extension of bipartite vertex cover to hypergraphs, namely finding a small vertex cover in kuniform k-partite hypergraphs, when the k-partition is gi...
متن کاملInapproximability of Minimum Vertex Cover on k-Uniform k-Partite Hypergraphs
We study the problem of computing the minimum vertex cover on k-uniform k-partite hypergraphs when the k-partition is given. On bipartite graphs (k = 2), the minimum vertex cover can be computed in polynomial time. For k ≥ 3, this problem is known to be NP-hard. For general k, the problem was studied by Lovász [23], who gave a k2 -approximation based on the standard LP relaxation. Subsequent wo...
متن کاملNearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs
We study the problem of computing the minimum vertex cover on k-uniform k-partite hypergraphs when the k-partition is given. On bipartite graphs (k = 2), the minimum vertex cover can be computed in polynomial time. For general k, the problem was studied by Lovász [23], who gave a k 2 -approximation based on the standard LP relaxation. Subsequent work by Aharoni, Holzman and Krivelevich [1] show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Carpathian Mathematical Publications
سال: 2016
ISSN: 2313-0210,2075-9827
DOI: 10.15330/cmp.8.1.134-149