Results 31 to 40 of about 1,095,825 (329)
On hamiltonicity of uniform random intersection graphs
Lietuvos Matematikos Rinkinys, 2010 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
Asymptotics of m-Cliques in a Sparse Inhomogeneous Random Graph
Journal of Mathematics, 2022 One of the classical questions in random graph theory is to understand the asymptotics of subgraph counts. In inhomogeneous random graph, this question has not been well studied. In this study, we investigate the asymptotic distribution of m-cliques in a
Xiaofeng Zhao
doaj +1 more source
Revan Sombor indices: Analytical and statistical study
Mathematical Biosciences and Engineering, 2023 In this paper, we perform analytical and statistical studies of Revan indices on graphs $ G $: $ R(G) = \sum_{uv \in E(G)} F(r_u, r_v) $, where $ uv $ denotes the edge of $ G $ connecting the vertices $ u $ and $ v $, $ r_u $ is the Revan degree of the
V. R. Kulli +3 more
doaj +1 more source
Central limit theorem for the principal eigenvalue and eigenvector of Chung–Lu random graphs
Journal of Physics: Complexity, 2023 A Chung–Lu random graph is an inhomogeneous Erdős–Rényi random graph in which vertices are assigned average degrees, and pairs of vertices are connected by an edge with a probability that is proportional to the product of their average degrees ...
Pierfrancesco Dionigi +4 more
doaj +1 more source
International Journal of Distributed Sensor Networks, 2012 Suppose that n nodes with n 0 acquaintances per node are randomly deployed in a two-dimensional Euclidean space with the geographic restriction that each pair of nodes can exchange information between them directly only if the distance between them is at
Zhihong Liu +4 more
doaj +1 more source
Linear Algebra and its Applications, 2011 In 1970s, Gutman introduced the concept of the energy $\En(G)$ for a simple graph $G$, which is defined as the sum of the absolute values of the eigenvalues of $G$. This graph invariant has attracted much attention, and many lower and upper bounds have been established for some classes of graphs among which bipartite graphs are of particular interest ...
Wenxue Du, Yiyang Li, Xueliang Li
openaire +3 more sources
Gonality of random graphs [PDF]
Involve, a Journal of Mathematics, 2016 We show that the expected gonality of a random graph is asymptotic to the number of vertices.
Deveau, Andrew +3 more
openaire +5 more sources
International Journal of Distributed Sensor Networks, 2012 We theoretically and experimentally analyze the process of adding sparse random links to random wireless networks modeled as a random geometric graph. While this process has been previously proposed, we are the first to prove theoretical bounds on the ...
Gunes Ercal
doaj +1 more source
The contact process on scale-free networks evolving by vertex updating [PDF]
Royal Society Open Science, 2017 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