Related papers: Partial immunization of trees
A cut tree (or Gomory-Hu tree) of an undirected weighted graph G=(V,E) encodes a minimum s-t-cut for each vertex pair {s,t} \subseteq V and can be iteratively constructed by n-1 maximum flow computations. They solve the multiterminal…
Eternal domination is a dynamic process by which a graph is protected from an infinite sequence of vertex intrusions. In eternal distance-$k$ domination, guards initially occupy the vertices of a distance-$k$ dominating set. After a vertex…
In this paper we study the following extremal graph theoretic problem: Given an undirected Eulerian graph $G$, which Eulerian orientation minimizes or maximizes the number of arborescences? We solve the minimization for the complete graph…
The dynamic partial sorting problem asks for an algorithm that maintains lists of numbers under the link, cut and change value operations, and queries the sorted sequence of the $k$ least numbers in one of the lists. We first solve the…
Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…
For a graph $G$, let $\Pi(G)$ denote the set of all potential maximal cliques of $G$. For each subset $\Pi$ of $\Pi(G)$, let $\tw(G, \Pi)$ denote the smallest $k$ such that there is a tree-decomposition of $G$ of width $k$ whose bags all…
For a finite simple undirected graph $G$, let $\gamma(G)$ denote the size of a smallest dominating set of $G$ and $\mu(G)$ denote the number of eigenvalues of the Laplacian matrix of $G$ in the interval $[0,1)$, counting multiplicities.…
In this paper, we present a fully-dynamic distributed algorithm for maintaining a minimum spanning tree on general graphs with positive real edge weights. The goal of a dynamic MST algorithm is to update efficiently the minimum spanning…
The Z-domination game is a variant of the domination game in which each newly selected vertex $u$ in the game must have a not yet dominated neighbor, but after the move all vertices from the closed neighborhood of $u$ are declared to be…
We study the problem of maximizing the number of full degree vertices in a spanning tree $T$ of a graph $G$; that is, the number of vertices whose degree in $T$ equals its degree in $G$. In cubic graphs, this problem is equivalent to…
A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $S$ of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor…
Let $G=(V,E)$ be a graph and $p$ a positive integer. The $p$-domination number $\g_p(G)$ is the minimum cardinality of a set $D\subseteq V$ with $|N_G(x)\cap D|\geq p$ for all $x\in V\setminus D$. The $p$-reinforcement number $r_p(G)$ is…
Temporal graphs (in which edges are active at specified times) are of particular relevance for spreading processes on graphs, e.g.~the spread of disease or dissemination of information. Motivated by real-world applications, modification of…
A minimum dominating set in a graph is a minimum set of vertices such that every vertex of the graph either belongs to it, or is adjacent to one vertex of this set. This mathematical object is of high relevance in a number of applications…
Power domination is a two-step observation process that is used to monitor power networks and can be viewed as a combination of domination and zero forcing. Given a graph $G$, a subset $S\subseteq V(G)$ that can observe all vertices of $G$…
We investigate the inner vertex-isoperimetric problem on the $d$-regular tree $T_d$. We first determine the exact value of the inner vertex-isoperimetric profile $I_d(k) = \min\{ |\partial D| \mid D\subset T_d \text{ finite and connected},\…
The net of N ``physical'' neurons is considered as a dynamical system. These neurons form a complete graph. The state of any neuron is its electric potential. The potential linearly increases until reaches its maximal value. Then it falls…
Given a graph $G=(V,E)$ with non-negative real edge lengths and an integer parameter $k$, the Min-Max k-Tree Cover problem seeks to find a set of at most $k$ subtrees of $G$, such that the union of the trees is the vertex set $V$. The…
In the \emph{dynamic edge coloring} problem, one has to maintain a graph of maximum degree $\Delta$ with at most $\Delta+c$ colors, given updates to the edges of the graph. An important objective is to minimize the \emph{recourse}, which is…
We investigate space-time trade-offs for population protocols in sparse interaction graphs. In complete interaction graphs, optimal space-time trade-offs are known for the leader election and exact majority problems. However, it has…