Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0809.2236

The Complexity of the Evolution of Graph Labelings

Geir Agnarsson·Raymond Greenlaw·Sanpawat Kantabutra
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the {\sc Graph Relabeling Problem}--given an undirected, connected, simple graph $G = (V,E)$, two labelings $L$ and $L'$ of $G$, and label {\em flip} or {\em mutation} functions determine the complexity of transforming or evolving the labeling $L$ into $L'$\@. The transformation of $L$ into $L'$ can be viewed as an evolutionary process governed by the types of flips or mutations allowed. The number of applications of the function is the duration of the evolutionary period. The labels may reside on the vertices or the edges. We prove that vertex and edge relabelings have closely related computational complexities. Upper and lower bounds on the number of mutations required to evolve one labeling into another in a general graph are given. Exact bounds for the number of mutations required to evolve paths and stars are given. This corresponds to computing the exact distance between two vertices in the corresponding {\em Cayley graph}. We finally explore both vertex and edge relabeling with {\em privileged labels}, and resolve some open problems by providing precise characterizations of when these problems are solvable. Many of our results include algorithms for solving the problems, and in all cases the algorithms are polynomial-time. The problems studied have applications in areas such as bioinformatics, networks, and VLSI.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra. 2008-09-12. The Complexity of the Evolution of Graph Labelings. https://arxiv.org/abs/0809.2236

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗