Results 41 to 50 of about 3,067,250 (321)

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

Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions

Theory and Applications of Graphs
Given 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

Fully graphic degree sequences and P-stable degree sequences

Advances in Applied Mathematics
23 pages, 1 ...
Péter L. Erdős, István Miklós, Lajos Soukup   +2 more
openaire   +3 more sources

On degree sequence

Ubiquity, 2008
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, Krishnendu Basuli, Samar Sen Sarma, Kashi Nath Dey   +3 more
openaire   +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, Maceková Mária, Montassier Mickaël, Soták Roman   +3 more
doaj   +1 more source

Diamond-free Degree Sequences

, 2012
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]

Physical Review E, 2008
8 pages, 3 figures, added a new table and a new figure, accepted for publication in Phys.Rev ...
Zamora-Lopez, Gorka, Zlatić, Vinko, Zhou, Changsong, Štefančić, Hrvoje, Kurths, Jürgen   +4 more
openaire   +4 more sources

Degree sequence

Osječki matematički list, 2020
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, Majstorović, Snježana   +1 more
openaire   +2 more sources

How likely is an i.i.d. degree sequence to be graphical?

, 2005
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, Richard Arratia, Thomas M. Liggett   +2 more
core   +3 more sources

Relations on generalized degree sequences

Discrete Mathematics, 2009
final version, to appear in Discrete ...
Klivans, Caroline J., Nyman, Kathryn L., Tenner, Bridget E.   +2 more
openaire   +2 more sources