相关论文: Infectious power domination of hypergraphs
We study the problem of parameter estimation based on infection data from an epidemic outbreak on a graph. We assume that successive infections occur via contagion; i.e., transmissions can only spread across existing directed edges in the…
In the real world, many complex systems interact with other systems. In addition, the intra- or inter-systems for the spread of information about infectious diseases and the transmission of infectious diseases are often not random, but with…
We study the growth of two competing infection types on graphs generated by the configuration model with a given degree sequence. Starting from two vertices chosen uniformly at random, the infection types spread via the edges in the graph…
To monitor electrical activity throughout the power grid and mitigate outages, sensors known as phasor measurement units can installed. Due to implementation costs, it is desirable to minimize the number of sensors deployed while ensuring…
A problem closely related to epidemiology, where a subgraph of 'infected' links is defined inside a larger network, is investigated. This subgraph is generated from the underlying network by a random variable, which decides whether a link…
For a graphical property $\mathcal{P}$ and a graph $G$, a subset $S$ of vertices of $G$ is a $\mathcal{P}$-set if the subgraph induced by $S$ has the property $\mathcal{P}$. The domination number with respect to the property $\mathcal{P}$,…
In this paper, we consider the following problem: given a connected graph $G$, can we reduce the domination number of $G$ by one by using only one edge contraction? We show that the problem is $\mathsf{NP}$-hard when restricted to…
A temporal graph is a finite sequence of graphs, called snapshots, over the same vertex set. Many temporal graph problems turn out to be much more difficult than their static counterparts. One such problem is \textsc{Timeline Vertex Cover}…
The hypergraph offers a platform to study structural properties emerging from more complicated and higher-order than pairwise interactions among constituents and dynamical behavior such as the spread of information or disease. Recently, a…
We prove that for every graph $G$ on $n$ vertices and with minimum degree five, the domination number $\gamma(G)$ cannot exceed $n/3$. The proof combines an algorithmic approach and the discharging method. Using the same technique, we…
We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s and t, and the goal is to find an s-t cut by assigning "powers" at the…
Suppose there is a spreading process such as an infectious disease propagating on a graph. How would we reduce the number of affected nodes in the spreading process? This question appears in recent studies about implementing mobility…
We examine the spread of an infectious disease, such as one that is caused by a respiratory virus, with two distinct modes of transmission. To do this, we consider a susceptible--infected--susceptible (SIS) disease on a hypergraph, which…
Roman domination is one of few examples where the related extension problem is polynomial-time solvable even if the original decision problem is NP-complete. This is interesting, as it allows to establish polynomial-delay enumeration…
We study the minimum dominating set problem as a representative combinatorial optimization challenge with a global topological constraint. The requirement that the backbone induced by the vertices of a dominating set should be a connected…
Given a graph $G=(V,E)$ of order $n$ and an $n$-dimensional non-negative vector $d=(d(1),d(2),\ldots,d(n))$, called demand vector, the vector domination (resp., total vector domination) is the problem of finding a minimum $S\subseteq V$…
A power dominating set of a graph $G=(V,E)$ is a set $S\subset V$ that colors every vertex of $G$ according to the following rules: in the first timestep, every vertex in $N[S]$ becomes colored; in each subsequent timestep, every vertex…
Majority bootstrap percolation on a graph $G$ is an epidemic process defined in the following manner. Firstly, an initially infected set of vertices is selected. Then step by step the vertices that have more infected than non-infected…
Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient…
We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $r$ active neighbors, where $r>1$ is the activation…