Search results for "Computer Science::Discrete Mathematics"
showing 5 items of 55 documents
Color Image Segmentation: The Hypergraph Framework
2006
International audience; Color Image Segmentation: The Hypergraph Framework
Some Decision Results on Nonrepetitive Words
1985
The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.
A Constructive Arboricity Approximation Scheme
2020
The arboricity \(\varGamma \) of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they approximate the arboricity as a value without computing a corresponding forest partition. This is because they operate on pseudoforest partitions or the dual problem of finding dense subgraphs.
Königs eigenfunction for composition operators on Bloch and H∞ type spaces
2017
Abstract We discuss when the Konigs eigenfunction associated with a non-automorphic selfmap of the complex unit disc that fixes the origin belongs to Banach spaces of holomorphic functions of Bloch and H ∞ type. In the latter case, our characterization answers a question of P. Bourdon. Some spectral properties of composition operators on H ∞ for unbounded Konigs eigenfunction are obtained.
The b-chromatic number of power graphs
2003
The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x_i adjacent to a vertex of every color j, 1 ≤ j ≠ i ≤ k. In this paper, we discuss the b-chromatic number of some power graphs. We give the exact value of the b-chromatic number of power paths and power complete binary trees, and we bound the b-chromatic number of power cycles.