Related papers: Prime stars multiplexes
In network science, the non-homogeneity of node degrees has been a concerned issue for study. Yet, with the modern web technologies today, the traditional social communication topologies have evolved from node-central structures to online…
Given a graph whose edges are labeled by ideals in a ring, a generalized spline is a labeling of each vertex by a ring element so that adjacent vertices differ by an element of the ideal associated to the edge. We study splines over the…
The authors develop a notion of homological prime spectrum for an arbitrary monoidal triangulated category, ${\mathbf C}$. Unlike the symmetric case due to Balmer, the homological primes of ${\mathbf C}$ are not defined as the maximal Serre…
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
Higher-order networks are gaining significant scientific attention due to their ability to encode the many-body interactions present in complex systems. However, higher-order networks have the limitation that they only capture many-body…
A hypergraph is linear if each pair of distinct vertices appears in at most one common edge. We say $\varGamma=(V,E)$ is an associated graph of a linear hypergraph $\mathcal{H}=(V, X)$ if for any $x\in X$, the induced subgraph…
We define an approach to identify overlapping communities in multiplex networks, extending the popular clique percolation method for simple graphs. The extension requires to rethink the basic concepts on which the clique percolation…
Multiplex networks are representations of multilayer interconnected complex networks where the nodes are the same at every layer. They turn out to be good abstractions of the intricate connectivity of multimodal transportation networks,…
Multilayer networks provide a powerful framework for modeling complex systems that capture different types of interactions between the same set of entities across multiple layers. Core-periphery detection involves partitioning the nodes of…
PEP-PEO block copolymer micelles offer the possibility to investigate phase behaviour and interactions of star polymers (ultra-soft colloids). A star-like architecture is achieved by an extremely asymmetric block ratio (1:20). Micellar…
The $k$-coprime graph of order $n$ is the graph with vertex set $\{k, k+1, \ldots, k+n-1\}$ in which two vertices are adjacent if and only if they are coprime. We characterize Hamiltonian $k$-coprime graphs. As a particular case, two…
In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…
This paper introduces a new class of efficient inter connection networks called as M-graphs for large multi-processor systems.The concept of M-matrix and M-graph is an extension of Mn-matrices and Mn-graphs.We analyze these M-graphs…
In this paper we study the set of prime ideals in vector lattices and how the properties of the prime ideals structure the vector lattice in question. The different properties that will be considered are firstly, that all or none of the…
Given a set of $n$ points $P$ in the plane, the first layer $L_1$ of $P$ is formed by the points that appear on $P$'s convex hull. In general, a point belongs to layer $L_i$, if it lies on the convex hull of the set $P \setminus…
Multilayer networks have been the subject of intense research during the last few years, as they represent better the interdependent nature of many real world systems. Here, we address the question of describing the three different…
High resolution surveys reveal that the interstellar medium in the Milky Way and nearby galaxies consists of interlinked hierarchies of filamentary structure and superbubbles extending from galactic to subpc scales. The characterization of…
In this paper we consider $r$-regular graphs $G$ that admit the vertex set partition such that one of the induced subgraphs is the join of an $s$-vertex clique and a $t$-vertex co-clique and represents a star complement for an eigenvalue…
Synchronization phenomena are of broad interest across disciplines and increasingly of interest in a multiplex network setting. Here we show how the Master Stability Function, a celebrated framework for analyzing synchronization on a single…
A graph is prime if it does not admit a partition $(A,B)$ of its vertex set such that $\min\{|A|,|B|\} \geq 2$ and the rank of the $A\times B$ submatrix of its adjacency matrix is at most $1$. A vertex $v$ of a graph is non-essential if at…