Related papers: Left and right convergence of graphs with bounded …
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
This paper proposes a simple but effective graph-based agglomerative algorithm, for clustering high-dimensional data. We explore the different roles of two fundamental concepts in graph theory, indegree and outdegree, in the context of…
We study the degree distribution of a randomly chosen vertex in a duplication--divergence graph, under a variety of different generalizations of the basic model of Bhan, Galas and Dewey (2002) and V\'azquez, Flammini, Maritan and Vespignani…
A family of random matrices is said to converge strongly to a limiting family of operators if the operator norm of every noncommutative polynomial of the matrices converges to that of the limiting operators. Recent developments surrounding…
There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the sequence. We formulate several novel sufficient graphicality…
The purpose of this paper is twofold. First, the definition of new statistical convergence with Fibonacci sequence is given and some fundamental properties of statistical convergence are examined. Second, approximation theory worked as a…
The statistical convergence is defined for sequences with the asymptotic density on the natural numbers, in general. In this paper, we introduce the statistical convergence for nets in Riesz spaces by using the finite additive measures on…
We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…
Necessary and sufficient conditions for the exactness (in the algebraic sense) of certain sequences of continuous group homomorphisms are established.
A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degree sequences, and show these characterizations to be…
We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known…
Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e. for every graph $F$, the number of homomorphisms from $F$ to $G$ equals the number…
A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$, $\{-1, 1\}$ labels are assigned to the edges, and we consider a family $\mathcal{S}_G$ of (spanning) subgraphs of…
We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…
Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their…
We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…