Related papers: Nets in groups, minimum length $g$-adic representa…
Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…
Let $G=(V,E)$ be a connected graph. A vertex $w\in V$ distinguishes two elements (vertices or edges) $x,y\in E\cup V$ if $d_G(w,x)\ne d_G(w,y)$. A set $S$ of vertices in a connected graph $G$ is a mixed metric generator for $G$ if every two…
Let $G$ be a graph having a vertex $v$ such that $H = G - v$ is a trivially perfect graph. We give a polynomial-time algorithm for the problem of deciding whether it is possible to add at most $k$ edges to $G$ to obtain a trivially perfect…
Say that an edge of a graph G dominates itself and every other edge adjacent to it. An edge dominating set of a graph G = (V,E) is a subset of edges E' of E which dominates all edges of G. In particular, if every edge of G is dominated by…
In data analysis, there is a strong demand for graph metrics that differ from the classical shortest path and resistance distances. Recently, several new classes of graph metrics have been proposed. This paper presents some of them…
Given a subset $W$ of an abelian group $G$, a subset $C$ is called an additive complement for $W$ if $W+C=G$; if, moreover, no proper subset of $C$ has this property, then we say that $C$ is a minimal complement for $W$. It is natural to…
This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…
The notion of minimal complements was introduced by Nathanson in 2011 as a natural group-theoretic analogue of the metric concept of nets. Given two non-empty subsets $W,W'$ in a group $G$, the set $W'$ is said to be a complement to $W$ if…
In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…
Algorithmic extension problems of partial graph representations such as planar graph drawings or geometric intersection representations are of growing interest in topological graph theory and graph drawing. In such an extension problem, we…
Metric dimension is an essential parameter in graph theory that aids in addressing issues pertaining to information retrieval, localization, network design, and chemistry through the identification of the least possible number of elements…
This paper introduces the tensor representation of a network, here tensors are the primitive structures of the network. In view of tensor chains, two binary operations on tensor sets are defined: chain addition and reducing. Based on the…
In this work we provide a way to introduce a probability measure on the space of minimal fillings of finite additive metric spaces as well as an algorithm for its computation. The values of probability, got from the analytical solution,…
A monitoring edge-geodetic set (or meg-set for short) of a graph is a set of vertices $M$ such that if any edge is removed, then the distance between some two vertices of $M$ increases. This notion was introduced by Foucaud et al. in 2023…
Graph connectivity and network design problems are among the most fundamental problems in combinatorial optimization. The minimum spanning tree problem, the two edge-connected spanning subgraph problem (2-ECSS) and the tree augmentation…
Graph modification problems are computational tasks where the goal is to change an input graph $G$ using operations from a fixed set, in order to make the resulting graph satisfy a target property, which usually entails membership to a…
Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…
Let $W,W'\subseteq G$ be nonempty subsets in an arbitrary group $G$. The set $W'$ is said to be a complement to $W$ if $WW'=G$ and it is minimal if no proper subset of $W'$ is a complement to $W$. We show that, if $W$ is finite then every…
We introduce a weak version of the classical length function, termed the weak length function, defined on subsets of $R$-modules over a unital ring $R$, and further consider the concept of mean weak length for $R\Gamma$-modules associated…
This paper studies the theory of the additive wireless network model, in which the received signal is abstracted as an addition of the transmitted signals. Our central observation is that the crucial challenge for computing in this model is…