Results 31 to 40 of about 178,682 (289)
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
Immunization for complex network based on the effective degree of vertex
, 2011 The basic idea of many effective immunization strategies is first to rank the importance of vertices according to the degrees of vertices and then remove the vertices from highest importance to lowest until the network becomes disconnected.
Barabási A.-L. +10 more
core +1 more source
Photodisintegration of the deuteron in the few GeV region using asymptotic amplitudes [PDF]
, 1999 Exclusive photodisintegration of the deuteron in the 1-4GeV range is described in terms of a simple covariant and gauge invariant approach using an effective counting rule as the hard part of the d-np vertex.
Dieperink, A. E. L., Nagorny, S. I.
core +2 more sources
Degree distance and vertex-connectivity
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ali, P., Mukwembi, S., Munyira, S.
openaire +2 more sources
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
F index of graphs based on four new operations related to the strong product
AKCE International Journal of Graphs and Combinatorics, 2020 For a molecular graph, the first Zagreb index of a graph is equal to the sum of squares of the vertex degrees of the graph and the forgotten topological index (F-index) of a graph is defined as the sum of cubes of the vertex degrees of the graph.
D. Sarala +3 more
doaj +1 more source
Monotonicity, asymptotic normality and vertex degrees in random graphs
, 2007 We exploit a result by Nerman which shows that conditional limit theorems hold when a certain monotonicity condition is satisfied. Our main result is an application to vertex degrees in random graphs, where we obtain asymptotic normality for the number ...
Janson, Svante
core +3 more sources
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
On existence of noncritical vertices in digraphs
, 2013 Let $D$ be a strongly connected digraphs on $n\ge 4$ vertices. A vertex $v$ of $D$ is noncritical, if the digraph $D-v$ is strongly connected. We prove, that if sum of the degrees of any two adjacent vertices of $D$ is at least $n+1$, then there exists a
Nenashev, G. V.
core +1 more source