Results 41 to 50 of about 3,049,614 (273)
, 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
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
Realizing Degree Sequences in Parallel [PDF]
SIAM Journal on Discrete Mathematics, 1996 Summary: A sequence \(d\) of integers is a degree sequence if there exists a (simple) graph \(G\) such that the components of \(d\) are equal to the degree of the vertices of \(G\). The graph \(G\) is said to be a realization of \(d\). We provide an efficient parallel algorithm to realize \(d\); the algorithm runs in \(O(\log n)\) time using \(O(n+ m)\)
Arikati, S., Maheshwari, A.
openaire +4 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
A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs
Discussiones Mathematicae Graph Theory, 2017 Let Ks,t be the complete bipartite graph with partite sets of size s and t. Let L1 = ([a1, b1], . . . , [am, bm]) and L2 = ([c1, d1], . . . , [cn, dn]) be two sequences of intervals consisting of nonnegative integers with a1 ≥ a2 ≥ . . . ≥ am and c1 ≥ c2
Guo Ji-Yun, Yin Jian-Hua
doaj +1 more source
On balanced bipartitions of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Bollobás and Scott conjectured that every graph G has a balanced bipartite spanning subgraph H such that for each for each In this paper, we consider the contrary side and show that every graphic sequence has a realization G which admits a balanced ...
Guangnuan Li
doaj +1 more source
Forcing $k$-Repetitions in Degree Sequences [PDF]
The Electronic Journal of Combinatorics, 2014 One of the most basic results in graph theory states that every graph with at least two vertices has two vertices with the same degree. Since there are graphs without $3$ vertices of the same degree, it is natural to ask if for any fixed $k$, every graph $G$ is "close" to a graph $G'$ with $k$ vertices of the same degree. Our main result in this paper
Caro, Yair +2 more
openaire +3 more sources
Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions
Theory and Applications of GraphsGiven a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1.
Michael R. Yatauro
doaj +1 more source
3-Paths in Graphs with Bounded Average Degree
Discussiones Mathematicae Graph Theory, 2016 In this paper we study the existence of unavoidable paths on three vertices in sparse graphs. A path uvw on three vertices u, v, and w is of type (i, j, k) if the degree of u (respectively v, w) is at most i (respectively j, k). We prove that every graph
Jendrol Stanislav +3 more
doaj +1 more source
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