Results 31 to 40 of about 21,321 (296)
Graph realizations: Maximum degree in vertex neighborhoods
Discrete Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amotz Bar-Noy +3 more
openaire +4 more sources
Limit laws of planar maps with prescribed vertex degrees [PDF]
, 2019 We prove a generalmulti-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers D.
Drmota, Michael +2 more
core +1 more source
ON THE VERTEX POSITION NUMBER OF GRAPHS [PDF]
, 2022 In this paper we generalise the notion of visibility from a point in an integer lattice to the setting of graph theory. For a vertex x of a graph G, we say that a set S subset of V (G) is an x-position set if for any y is an element of S the shortest x ...
Tuite J. +5 more
core +4 more sources
On clustering of conditional configuration graphs
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 limited random variables. They are equal to the number of vertex semiedges that are numbered in an arbitrary order.
Yury Pavlov
doaj +1 more source
Conjecture Involving Arithmetic-Geometric and Geometric-Arithmetic Indices
Discrete Dynamics in Nature and Society, 2022 The geometric-arithmetic (GA) index of a graph G is the sum of the ratios of geometric and arithmetic means of end-vertex degrees of edges of G. Similarly, the arithmetic-geometric (AG) index of G is defined. Recently, Vujošević et al. conjectured that a
Zainab Alsheekhhussain +3 more
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