Results 231 to 240 of about 42,000 (265)

Vertex-Degrees in Strata of a Random Recursive Tree

1985
A stratum S k of a rooted tree is a set of vertices whose distance from the root is equal to k . We shall derive exact and asymptotic formulas for the expected value A r (n, k) of the number of vertices of degree r in S k of a random recursive tree with n vertices.
Marian Dondajewski, Jerzy Szymańlskt, Peter Kirschenhofer   +2 more
openaire   +1 more source

Rigid and Flat Foldability of a Degree-Four Vertex in Origami

Journal of Mechanisms and Robotics, 2019
AbstractRigid foldability is the property of an origami that folds continuously from an unfolded to a folded state without deformation in its facets. Although extensively researched, there exist no intrinsic conditions for the rigid foldability of a degree-four vertex, which is the simplest possible origami building block that folds nontrivially.
Luca Zimmermann, Tino Stanković
openaire   +1 more source

Concentration of vertex degrees in a scale‐free random graph process

Random Structures & Algorithms, 2005
AbstractThe web may be viewed as a directed graph each of whose vertices is a static HTML Web page, and each of whose edges corresponds to a hyperlink from one Web page to another. In this paper we study the model of random graph (i.e., scale‐free random graph process) introduced by Barabási and Albert and formalized by Bollobás, Riordan, Spencer, and ...
openaire   +1 more source

Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey

Graphs and Combinatorics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chiba, Shuya, Yamashita, Tomoki
openaire   +2 more sources

Degree distribution of a typical vertex in a general random intersection graph

Lithuanian Mathematical Journal, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]^d

Advances in Applied Probability, 1997
This article continues an investigation begun in [2]. A random graph Gn(x) is constructed on independent random points U1, · ··, Un distributed uniformly on [0, 1]d, d ≧ 1, in which two distinct such points are joined by an edge if the l∞-distance between them is at most some prescribed value 0 < x < 1.Almost-sure asymptotic results are obtained ...
Appel, Martin J. B., Russo, Ralph P.
openaire   +3 more sources

On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree

Applied Mathematics and Computation, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Min, Yu, Weiqiang, Wang, Weifan
openaire   +1 more source

Degree of a vertex on product of two neutrosophic graphs

AIP Conference Proceedings, 2023
K. R. Balasubramanian, K. Rajeswari
openaire   +1 more source

Extremal values of vertex‐degree‐based topological indices of coronoid systems

International Journal of Quantum Chemistry, 2021
Roberto Cruz, Juan Rada
exaly  

Extremal Graphs to Vertex Degree Function Index for Convex Functions

Axioms, 2023
Chenxu Yang, Kinkar C Das
exaly