Related papers: Multicolored Dynamos on Toroidal Meshes
The notion of $S$-labeling of graphs, where $S$ is a subset of a symmetric group, was introduced in 2019 by Jin, Wong, and Zhu. This notion provides the framework for a common generalization of various well studied notions of graph…
From gene regulatory networks to mutualistic networks, controlling a single node in the network topology can transform these complex dynamical systems from undesirable states to desirable ones. Corresponding methods have been well-studied…
In this article, we revisit the complexity of the reconfiguration of independent sets under the token sliding rule on chordal graphs. In the \textsc{Token Sliding-Connectivity} problem, the input is a graph $G$ and an integer $k$, and the…
We consider the densest $k$-subgraph problem, which seeks to identify the $k$-node subgraph of a given input graph with maximum number of edges. This problem is well-known to be NP-hard, by reduction to the maximum clique problem. We…
The \textit{$r$-dynamic choosability} of a graph $G$, written ${\rm ch}_r(G)$, is the least $k$ such that whenever each vertex is assigned a list of at least $k$ colors a proper coloring can be chosen from the lists so that every vertex $v$…
The minimal number of nodes required to multilaterate a network endowed with geodesic distance (i.e., to uniquely identify all nodes based on shortest path distances to the selected nodes) is called its metric dimension. This quantity is…
Subgraph detection has recently been one of the most studied problems in the CONGEST model of distributed computing. In this work, we study the distributed complexity of problems closely related to subgraph detection, mainly focusing on…
We observe a network scenario where parts of a secret are distributed among its nodes. Within the network, a group of attackers is actively trying to obtain the complete secret, while there is also the issue of some nodes malfunctioning or…
In previous work, we developed the scaled SIS process, which models the dynamics of SIS epidemics over networks. With the scaled SIS process, we can consider networks that are finite-sized and of arbitrary topology (i.e., we are not…
We investigate the behavior of a simple majority dynamics on networks of agents whose interaction topology exhibits a community structure. By leveraging recent advancements in the analysis of dynamics, we prove that, when the states of the…
Recently, Dynamic Time Division Duplex (TDD) has been proposed to handle the asymmetry of traffic demand between DownLink (DL) and UpLink (UL) in Heterogeneous Networks (HetNets). However, for mixed traffic consisting of best effort traffic…
Models of simple excitable dynamics on graphs are an efficient framework for studying the interplay between network topology and dynamics. This subject is a topic of practical relevance to diverse fields, ranging from neuroscience 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…
In order to make more complex number-based strings from topological coding for defending against the intelligent attacks equipped with quantum computing and providing effective protection technology for the age of quantum computing, we will…
In graph theoretical models of the spread of disease through populations, the spread of opinion through social networks, and the spread of faults through distributed computer networks, vertices are in two states, either black or white, and…
A simple greedy algorithm to find a maximal independent set (MIS) in a graph starts with the empty set and visits every vertex, adding it to the set if and only if none of its neighbours are already in the set. In this paper, we consider…
The minimal dominating Set (MDS) problem is a prototypical hard combinatorial optimization problem. Two years ago we studied this problem by cavity method. Although we get the solution of a given graph, which gives very good estimation of…
The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and has been well studied. In this paper, we consider the following Balanced Connected Subgraph (shortly,…
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assigned to the edges is minimum. The {\em chromatic edge strength}…
A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption…