Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"graph labeling"”.
-
List, Sample, and Count
… of contexts including combinatorics, cryptography, voting theory, and game theory. Next, we consider permutations of n pairs of numbers, called Skolem sequences. These sequences are employed in several areas including construction of Steiner triple systems, binary sequences with controllable …
-
New algorithms and impossibility results under restricted interfaces
… we investigate local computation algorithms for graph labeling, with a focus on lower bounds. This line of work sharpens the same theme in a fully local setting: even when a valid labeling is easy to construct centrally, answering vertex queries consistently can require nearly exponential probe …
-
GRAPH-BASED APPROACHES FOR IMBALANCED DATA IN FUNCTIONAL GENOMICS
… learning problem in an undirected graph. Indeed, given a graph with a partial graph labeling, where nodes represent genes, edges functional relationships between genes, and labels their membership to functional classes, GFP consists in inferring the unknown functional classes of …
-
Optimal L(h, k) labelings of Cartesian products of complete graphs and paths
In an $L(h,k)$ labeling of a graph $G$ we assign non-negative integers to the vertices of the graph such that the labels of the vertices that are at a distance of one have a difference of at least $h$ and the labels of the vertices which are at a distance of two have a difference of at least $k$. …
-
Even Harmonious Labelings of Disconnected Graphs
A graph $G$ with $q$ edges is called \textit{graceful} if there is an injection from the vertices of $G$ to the set $\{0,1,\ldots,q\}$ such that when each edge $xy$ is assigned the label $|f(x)-f(y)|$, the resulting edge labels are distinct. This notion as well as a number of other functions from a …
-
Magic labelings of directed graphs
Let G be a directed graph with a total labeling. The additive arc-weight of an arc xy is the sum of the label on xy and the label on y. The additive directed vertex-weight of a vertex x is the sum of the label on x and the labels on all arcs with head at x. The graph is additive arc magic if all …
-
Distance magic-type and distance antimagic-type labelings of graphs
Generally speaking, a distance magic-type labeling of a graph G of order n is a bijection f from the vertex set of the graph to the first n natural numbers or to the elements of a group of order n, with the property that the weight of each vertex is the same. The weight of a vertex x is defined as …