Results 41 to 50 of about 2,991,925 (319)
The polytope of degree sequences
Linear Algebra and its Applications, 1989 AbstractA nonnegative integer sequence (d1,d2,…,dn) is called a degree sequence if there exists a simple graph on the vertex set V= {1,2,…,n} such that deg(i)= di for all i. The degree sequence of a threshold graph is a threshold sequence. Let Dn= Convex Hull {(x1,x2,…,xn)|(x1,…,xn) is a degree sequence}.
Murali K. Srinivasan, Uri N. Peled
openaire +2 more sources
Multi-switch: A tool for finding potential edge-disjoint 1-factors
Electronic Journal of Graph Theory and Applications, 2021 Let n be even, let π = (d1, ... , dn) be a graphic degree sequence, and let π - k = (d1-k, ... , dn-k) also be graphic. Kundu proved that π has a realization G containing a k-factor, or k-regular graph.
Tyler Seacrest
doaj +1 more source
, 2014 Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs.
Deák, Attila
core +4 more sources
Informatica, 2019 Assume that we are given two graphic sequences, $\pi_1$ and $\pi_2$. We consider conditions for $\pi_1$ and $\pi_2$ which guarantee that there exists a simple graph $G_2$ realizing $\pi_2$ such that $G_2$ is the subgraph of any simple graph $G_1$ that realizes $\pi_1$.
Béla Csaba, Bálint Vásárhelyi
openaire +4 more sources
Degree sequences of matrogenic graphs
Discrete Mathematics, 1984 The structure of matrogenic graphs introduced by \textit{S. Földes} and \textit{P. L. Hammer} [Combinatorics, Keszthely 1976, Colloq. Math. Soc. Janos Bolyai 18, 331-352 (1978; Zbl 0395.05021)] is described. In particular, it is proved that every matrogenic graph is the unique realization up to isomorphism, of its degree sequence.
MARCHIORO P. +3 more
openaire +4 more sources
Empirical Likelihodd Methods for an AR(1) process with ARCH(1) errors [PDF]
, 2006 For an AR(1) process with ARCH(1) errors, we propose empirical likelihood tests for testing whether the sequence is strictly stationary but has infinite variance, or the sequence is an ARCH(1) sequence or the sequence is an iid sequence.
Klüppelberg, Claudia, Peng, Liang
core +2 more sources
Application value of 3.0T MRI 3D-MERGE sequence in evaluating the degree of supraspinatus tendon injury [PDF]
Zhenduanxue lilun yu shijian, 2021 Objective: To study the application value of 3.0T MRI 3D-MERGE sequence in evaluating the degree of supraspinatus tendon injury. Methods: A total of 52 patients with shoulder pain diagnosed with arthroscopy were enrolled.
CAO Juntao, HU Ming, QIAN Pingkang, TU Jianchun, ZHANG Huan, SHEN Junkang
doaj +1 more source
Relations on generalized degree sequences
Discrete Mathematics, 2009 final version, to appear in Discrete ...
Caroline J. Klivans +2 more
openaire +3 more sources
Discussiones Mathematicae Graph Theory, 2020 Let S = (a1,. . . , am; b1, . . . , bn), where a1, . . . , am and b1, . . . , bn are two sequences of nonnegative integers. We say that S is a bigraphic pair if there exists a simple bipartite graph G with partite sets {x1, x2, . . . , xm} and {y1, y2, .
Yin Jian-Hua, Li Sha-Sha
doaj +1 more source
Degree sequences in complexes and hypergraphs [PDF]
Proceedings of the American Mathematical Society, 1975 Given an n n -complex K K and a vertex v v in K K , the n n -degree of v v is the number of n n -simplexes in K K containing v v . The set of all n n -degrees in a complex
openaire +1 more source