Results 1 to 10 of about 2,603,262 (299)
The number of planar graphs and properties of random planar graphs [PDF]
We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.
Omer Gimenez, Marc Noy
doaj +1 more source
A Continuous-Time Network Evolution Model Describing 2- and 3-Interactions
A continuous-time network evolution model is considered. The evolution of the network is based on 2- and 3-interactions. 2-interactions are described by edges, and 3-interactions are described by triangles.
István Fazekas, Attila Barta
doaj +1 more source
Asymptotic Behavior of the Edge Metric Dimension of the Random Graph
Given a simple connected graph G(V,E), the edge metric dimension, denoted edim(G), is the least size of a set S ⊆ V that distinguishes every pair of edges of G, in the sense that the edges have pairwise different tuples of distances to the vertices of S.
Zubrilina Nina
doaj +1 more source
Taylor’s power law for the
Taylor’s power law states that the variance function decays as a power law. It is observed for population densities of species in ecology. For random networks another power law, that is, the power law degree distribution is widely studied.
István Fazekas +2 more
doaj +1 more source
Estrada Index and Laplacian Estrada Index of Random Interdependent Graphs
Let G be a simple graph of order n. The Estrada index and Laplacian Estrada index of G are defined by E E ( G ) = ∑ i = 1 n e λ i ( A ( G ) ) and L E E ( G ) = ∑ i = 1 n e λ i ( L ( G ) ) , where { λ i
Yilun Shang
doaj +1 more source
Two modified Zagreb indices for random structures
Random structure plays an important role in the composition of compounds, and topological index is an important index to measure indirectly the properties of compounds.
Li Siman, Shi Li, Gao Wei
doaj +1 more source
On the Validity of Neural Mass Models
Modeling the dynamics of neural masses is a common approach in the study of neural populations. Various models have been proven useful to describe a plenitude of empirical observations including self-sustained local oscillations and patterns of distant ...
Nicolás Deschle +6 more
doaj +1 more source
The contact process on scale-free networks evolving by vertex updating [PDF]
We study the contact process on a class of evolving scale-free networks, where each node updates its connections at independent random times. We give a rigorous mathematical proof that there is a transition between a phase where for all infection rates ...
Emmanuel Jacob, Peter Mörters
doaj +1 more source
On hamiltonicity of uniform random intersection graphs
We give a sufficient condition for the hamiltonicity of the uniform random intersection graph G{n,m,d}. It is a graph on n vertices, where each vertex is assigned d keys drawn independently at random from a given set of m keys, and where any two vertices
Mindaugas Bloznelis +1 more
doaj +1 more source
On the number of series parallel and outerplanar graphs [PDF]
We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g \cdot n^{-5/2} \gamma^n n!$, where $\gamma$ and $g$ are explicit computable constants.
Manuel Bodirsky +3 more
doaj +1 more source

