Results 31 to 40 of about 21,234 (294)
Majorization and the number of bipartite graphs for given vertex degrees [PDF]
Transactions on Combinatorics, 2018 The emph{bipartite realisation problem} asks for a pair of non-negative, non-increasing integer lists $a:=(a_1,ldots,a_n)$ and $b:=(b_1,ldots,b_{n'})$ if there is a labeled bipartite graph $G(U,V,E)$ (no loops or multiple edges) such that each vertex ...
Annabell Berger
doaj +1 more source
Limit distributions of vertex degrees in a conditional configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 The configuration graph where vertex degrees are independent identically distributed random variables is often used for modeling of complex networks such as the Internet. We consider a random graph consisting of N vertices.
Irina Chepliukova, Yuri Pavlov
doaj +1 more source
Mathematics, 2022 A Multinomial Processing Tree (MPT) is a directed tree with a probability associated with each arc and partitioned terminal vertices. We consider an additional parameter for each arc, a measure such as time. Each vertex represents a process.
Richard Schweickert, Xiaofang Zheng
doaj +1 more source
Exact Solutions of a Generalized Weighted Scale Free Network
Journal of Applied Mathematics, 2013 We investigate a class of generalized weighted scale-free networks, where the new vertex connects to m pairs of vertices selected preferentially. The key contribution of this paper is that, from the standpoint of random processes, we provide rigorous ...
Li Tan, Dingyou Lei
doaj +1 more source
On conditional configuration graphs with random distribution of vertex degrees
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2016 We consider a configuration graph with N vertices. The degrees of the vertices are drawn independently from a discrete power-law distribution with positive parameter τ . They are equal to the number of each vertex’s numbered semiedges.
Yury Pavlov
doaj +1 more source
Distinct degrees in induced subgraphs [PDF]
, 2020 An important theme of recent research in Ramsey theory has been establishing pseudorandomness properties of Ramsey graphs. An N-vertex graph is called C-Ramsey if it has no homogeneous set of size C logN.
Keevash, Peter +3 more
core +1 more source
Limit distributions of maximum vertex degree in a conditional configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed random variables following the power-law distribution with positive parameter τ.
Irina Cheplyukova
doaj +1 more source
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs
, 2022 A 2-connected non-hamiltonian graph G is a k-graph if for exactly k < |V(G)| vertices in G, removing such a vertex yields a non-hamiltonian graph. We characterise k-graphs of connectivity 2 and describe structurally interesting examples of such graphs ...
Zamfirescu, Carol
core +1 more source
Frontiers in PhysicsIn this article, a quantitative structure-property relationship is performed for the prediction of six physico-chemical properties of 16 alkaloid structures using three different types of degree-based topological indices.
Muhammad Waheed Rasheed +2 more
doaj +1 more source
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 We consider configuration graphs with N vertices. The degrees of the vertices are independent random variables identically distributed according to the power law, with a positive parameter τ .
Yury Pavlov
doaj +1 more source