Results 51 to 60 of about 3,049,614 (273)
Fully graphic degree sequences and P-stable degree sequences
23 pages, 1 ...
Péter L. Erdős +2 more
openaire +3 more sources
I ndi got her BS in Computer Science from Cal Poly and began her master's at Colorado State. She then worked as a software engineer, later managing Web applications that focused on the user. Her concepts in mental models derive from attempting to bridge the developer-user gap.
Saptarshi Naskar +3 more
openaire +1 more source
8 pages, 2 figures, 2 algorithms, 2 models, 1 ...
Miller, Alice, Prosser, Patrick
openaire +3 more sources
Reciprocity of networks with degree correlations and arbitrary degree sequences [PDF]
8 pages, 3 figures, added a new table and a new figure, accepted for publication in Phys.Rev ...
Zamora-Lopez, Gorka +4 more
openaire +4 more sources
U radu proučavamo niz stupnjeva neusmjerenog konačnog jednostavnog grafa. Navodimo dva najpoznatija kriterija koji daju nužne i dovoljne uvjete koje mora zadovoljavati niz nenegativnih cijelih brojeva da bi predstavljao niz stupnjeva nekog grafa, teorem Havela i Hakima te teorem Erdősa i Gallaia.
Begović, Dolores +1 more
openaire +2 more sources
How likely is an i.i.d. degree sequence to be graphical?
Given i.i.d. positive integer valued random variables D_1,...,D_n, one can ask whether there is a simple graph on n vertices so that the degrees of the vertices are D_1,...,D_n. We give sufficient conditions on the distribution of D_i for the probability
No. B +2 more
core +3 more sources
Relations on generalized degree sequences
final version, to appear in Discrete ...
Klivans, Caroline J. +2 more
openaire +2 more sources
Efficient counting of degree sequences [PDF]
Novel dynamic programming algorithms to count the set $D(n)$ of zero-free degree sequences of length $n$, the set $D_c(n)$ of degree sequences of connected graphs on $n$ vertices and the set $D_b(n)$ of degree sequences of biconnected graphs on $n$ vertices exactly are presented.
openaire +2 more sources
ABSTRACT Introduction Characterizing stressful events reported by childhood cancer survivors experienced throughout the lifespan may help improve trauma‐informed care relevant to the survivor experience. Methods Participants included 2552 survivors (54% female; 34 years of age) and 469 community controls (62% female; 33 years of age) from the St.
Megan E. Ware +13 more
wiley +1 more source
Computing the sum of k largest Laplacian eigenvalues of tricyclic graphs [PDF]
Pawan Kumar +2 more
doaj +1 more source

