Related papers: Some Combinatorial Problems in Power-law Graphs
Most random graph models are locally tree-like - do not contain short cycles - rendering them unfit for modeling networks with a community structure. We introduce the hierarchical configuration model (HCM), a generalization of the…
Large real-world networks typically follow a power-law degree distribution. To study such networks, numerous random graph models have been proposed. However, real-world networks are not drawn at random. Therefore, Brach, Cygan, {\L}acki,…
Complex networks are everywhere. They appear for example in the form of biological networks, social networks, or computer networks and have been studied extensively. Efficient algorithms to solve problems on complex networks play a central…
Understanding the mathematical properties of graphs underling biological systems could give hints on the evolutionary mechanisms behind these structures. In this article we perform a complete statistical analysis over thousands of graphs…
The upper and lower Nordhaus-Gaddum bounds over all graphs for the power domination number follow from known bounds on the domination number and examples. In this note we improve the upper sum bound for the power domination number…
Dealing with the NP-complete Dominating Set problem on undirected graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In particular, we prove that Dominating Set restricted to…
Let $G=(V,E)$ be a graph. A subset $D\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. The domination number of $G$, denoted by $\gamma(G)$, is the smallest cardinality of a dominating set of $G$.…
Given two subsets A and B of nodes in a directed graph, the conduciveness of the graph from A to B is the ratio representing how many of the edges outgoing from nodes in A are incoming to nodes in B. When the graph's nodes stand for the…
Graph energy and Domination in graphs are most studied areas of graph theory. In this paper we made an attempt to connect these two areas of graph theory by introducing c-dominating energy of a graph $G$. First, we show the chemical…
We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…
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…
Random network models generated using sparse exchangeable graphs have provided a mechanism to study a wide variety of complex real-life networks. In particular, these models help with investigating power-law properties of degree…
In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction. We prove optimal bounds for $\gamma\_{p,k}(G-e)$,…
Popular matchings provide a model of matching under preferences in which a solution corresponds to a Condorcet winner in voting systems. In a bipartite graph in which the vertices have preferences over their neighbours, a matching is…
Recurrence networks are a novel tool of nonlinear time series analysis allowing the characterisation of higher-order geometric properties of complex dynamical systems based on recurrences in phase space, which are a fundamental concept in…
The two graphs of the title both have vertex set G. In the intersection power graph, x and y are joined if some non-identity element is a power of both; in the power graph, x and y joined if one is a power of the other. Thus the power graph…
Power law distribution is common in real-world networks including online social networks. Many studies on complex networks focus on the characteristics of vertices, which are always proved to follow the power law. However, few researches…
The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and near-linear-time algorithms exist, they use sophisticated data structures. We…
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…