Results 61 to 70 of about 9,193,291 (353)
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
On the Degree Sequences of Uniform Hypergraphs [PDF]
In hypergraph theory, determining a good characterization of d, the degree sequence of an h-uniform hypergraph $\mathcal{H}$, and deciding the complexity status of the reconstruction of $\mathcal{H}$ from d, are two challenging open problems. They can be formulated in the context of discrete tomography: asks whether there is a matrix A with nonnegative
FROSINI, ANDREA+2 more
openaire +3 more sources
A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs
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
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
Relations on generalized degree sequences
final version, to appear in Discrete ...
Caroline J. Klivans+2 more
openaire +3 more sources
Application value of 3.0T MRI 3D-MERGE sequence in evaluating the degree of supraspinatus tendon injury [PDF]
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
DEGREE SEQUENCE OF RANDOM PERMUTATION GRAPHS [PDF]
In this paper we study the degree sequence of the permutation graph $G_{\pi_n}$ associated with a sequence $\pi_n\in S_n$ of random permutations. Joint limiting distributions of the degrees are established using results from graph and permutation limit ...
B. Bhattacharya, S. Mukherjee
semanticscholar +1 more source
Reduced criteria for degree sequences [PDF]
For many types of graphs, criteria have been discovered that give necessary and sufficient conditions for an integer sequence to be the degree sequence of such a graph. These criteria tend to take the form of a set of inequalities, and in the case of the Erd s-Gallai criterion (for simple undirected graphs) and the Gale-Ryser criterion (for bipartite ...
openaire +2 more sources
Random graphs with a given degree sequence
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have graph limits in
Chatterjee, Sourav+2 more
core +1 more source
Sampling k-partite graphs with a given degree sequence
The authors in the paper [15] presented an algorithm that generates uniformly all the bipartite realizations and the other algorithm that generates uniformly all the simple bipartite realizations whenever A is a bipartite degree sequence of a simple ...
Kayibi Koko K.+3 more
doaj +1 more source