Results 1 to 10 of about 971,776 (299)
The clustering coefficient of a scale-free random graph
, 2009 We consider a random graph process in which, at each time step, a new vertex is added with m out-neighbours, chosen with probabilities proportional to their degree plus a strictly positive constant.
Eggemann, N, Noble, S D
core
Flooding in dynamic graphs with arbitrary degree sequence
, 2014 International audienceThis paper addresses the flooding problem in dynamic graphs, where flooding is the basic mechanism in which every node becoming aware of a piece of information at step tt forwards this information to all its neighbors at all ...
Fraigniaud, Pierre +2 more
core +1 more source
Asymptotic Enumeration by Degree Sequence of Graphs of High Degree
, 1990 We consider the estimation of the number of labelled simple graphs with degree sequence d1, d2, . . . , dn by using an n-dimensional Cauchy integral. For sufficiently small ε and any c > 2/3, an asymptotic formula is obtained when |di − d| < n1/2 + ε for
Wormald, Nicholas C., McKay, Brendan D.
core +1 more source
The Journal of Engineering, 2018 In order to analyse the influence of different performance indexes on the working reliability of a tractor multi-way valve. The grey correlation theory is introduced into the reliability analysis of multi-way valves.
Liping Xu, Haoyi Ma, Dezhi Ren
doaj +1 more source
Sequence-Controlled Polymerization-Induced Self-Assembly
, 2019 We herein present sequence-controlled polymerization-induced self-assembly (PISA) via photoswitchable reversible addition–fragmentation chain transfer (RAFT) copolymerization of oppositely-charged monomers using polyethylene glycol chain transfer agent ...
Yi Ding (172783) +13 more
core +1 more source
k-Edge-Connected Multigraphical Degree Sequence Problem [PDF]
, 1995 application/pdf論文(Article)A sequence of nonnegative integers S=(s₁, s₂,…,sn) is k-edge-connected multigraphical if there is a k-edge-connected multigraph with vertices v₁, v₂,…,Vn such that deg (vj)=sj for each j= 1, 2,…， n.
3324, TAKAHASHI, Masaya
core
Minimal forbidden sets for degree sequence characterizations
, 2015 Given a set F of graphs, a graph G is F-free if G does not contain any member of as an induced subgraph. A set F is degree-sequence-forcing (DSF) if, for each graph G in the class C of -free graphs, every realization of the degree sequence of G is also ...
Barrus, Michael D., Hartke, Stephen G.
core +1 more source
The Bipartite-Splittance of a Bipartite Graph
Discussiones Mathematicae Graph Theory, 2019 A bipartite-split graph is a bipartite graph whose vertex set can be partitioned into a complete bipartite set and an independent set. The bipartite- splittance of an arbitrary bipartite graph is the minimum number of edges to be added or removed in ...
Yin Jian-Hua, Guan Jing-Xin
doaj +1 more source
New Results on Graph Matching from Degree-Preserving Growth
MathematicsThe recently introduced model in S. R. Kharel et al.’s study [Degree-preserving network growth. Nature Physics 2022, 18, 100–106] uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence.
Péter L. Erdős +3 more
doaj +1 more source
The Degree Sequence Problem for 3-Hypergraphs
, 2016 Currently the degree sequence problem for 3-hypergraphs is still unsolved efficiently. This paper researches the 3-hypergraphic problem in terms of edge switching and exchanges in the sequence to implement Dewdney’s reduction.
Zou, Yangsheng
core