Related papers: Triple-loop networks with arbitrarily many minimum…
The $\mathsf{HYBRID}$ model was introduced as a means for theoretical study of distributed networks that use various communication modes. Conceptually, it is a synchronous message passing model with a local communication mode, where in each…
In this paper we consider two-loop two-, three- and four-point diagrams with elliptic structure in the case of two different masses $m$ and $M$. The latter diagrams generally arise within NRQCD matching procedures and are relevant for…
In this paper we study when the $q$-distance matrix of a distance-regular graph has few distinct eigenvalues. We mainly concentrate on diameter 3.
We study distance properties of a general class of random directed acyclic graphs (DAGs). In a DAG, many natural notions of distance are possible, for there exists multiple paths between pairs of nodes. The distance of interest for circuits…
Various real-life networks of current interest are simultaneously scale-free and modular. Here we study analytically the average distance in a class of deterministically growing scale-free modular networks. By virtue of the recursive…
Network motifs are small building blocks of complex networks. Statistically significant motifs often perform network-specific functions. However, the precise nature of the connection between motifs and the global structure and function of…
For any two disjoint oriented circles embedded into the 3-dimensional real projective space, we construct a 3-dimensional configuration space and its map to the projective space such that the linking number of the circles is the half of the…
This article explores a new type of optimal covering of a complete graph by small cliques of different sizes, namely the minimum covering with minimum excess. In particular, the minimum size of a covering by triples and quadruples with…
The WL-dimension of a graph X is the smallest positive integer m such that the m-dimensional Weisfeiler-Leman algorithm correctly tests the isomorphism between X and any other graph. It is proved that the WL-dimension of any circulant graph…
A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel intermediate-level topological analysis that considers non-overlapping subgraphs…
Multi-layered social networks consist of the fixed set of nodes linked by multiple connections. These connections may be derived from different types of user activities logged in the IT system. To calculate any structural measures for…
Minimal multicast networks are fascinating and efficient combinatorial objects, where the removal of a single link makes it impossible for all receivers to obtain all messages. We study the structure of such networks, and prove some…
Radial Moore graphs and digraphs are extremal graphs related to the Moore ones where the distance-preserving spanning tree is preserved for some vertices. This leads to classify them according to their proximity to being a Moore graph or…
In this paper we prove that if a pair of graphs G,H have senders, then they necessarily have connected minimal senders; we also prove that given two fixed graphs that are either 3-connected or triangles there are minimal (G,H)-senders with…
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared with the ones in a random graph. Examples of small-world…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…
An association scheme is $P$-polynomial if and only if it consists of the distance matrices of a distance-regular graph. Recently, bivariate $P$-polynomial association schemes of type $(\alpha,\beta)$ were introduced by Bernard et al., and…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…
In this paper, we give definitions of three kinds of minimal charts, and we investigate properties of minimal charts and establish fundamental theorems characterizing minimal charts. To classify charts with two or three crossings we use the…
We present a simple method which simplifies the evaluation of the on-shell multiple box diagrams reducing them to triangle type ones. For the $L$-loop diagram one gets the expression in terms of Feynman parameters with $2L$-fold…