Results 251 to 260 of about 5,011,430 (289)

Possible delayed neuronal death after seemingly successful evacuation of traumatic acute subdural hematoma: Image report. [PDF]

Surg Neurol Int
Wakahara S, Ushita H, Inamasu J.
europepmc   +1 more source

Predictive analytics for supply chain resilience in urban infrastructure networks using graph convolutional networks. [PDF]

PLoS One
Liu Y, Hu R, Zhang W, Wu Q.
europepmc   +1 more source

Using MR-chordless circuits for efficient enumeration of autocatalytic cores in large chemical reaction networks. [PDF]

J Cheminform
Golnik R, Vassena N, Stadler PF, Gatter T, Gatter T.   +4 more
europepmc   +1 more source

Detection of the Novel HLA-A*01:522 Allele by Next-Generation Sequencing in a Brazilian Individual. [PDF]

HLA
Dos Santos RR, Massi FP, Hirata BKB, de Souza Terron M, Pinto LDB.   +4 more
europepmc   +1 more source

Identification of the Novel HLA-E*01:157 Allele by Next-Generation Sequencing. [PDF]

HLA
Dong L, He Y, Pi W, Chen N, Zhu F.
europepmc   +1 more source

Adjacency Relationships Forced by a Degree Sequence [PDF]

Graphs and Combinatorics, 2018
There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are not.
Michael D Barrus
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Convexity of degree sequences

Journal of Graph Theory, 1999
Summary: We explore the convexity of the set of vectors consisting of degree sequences of subgraphs of a given graph. Results of \textit{P. Katerinis} [J. Graph Theory 9, No. 4, 513-521 (1985; Zbl 0664.05047)] and \textit{P. Fraisse}, \textit{P. Hell} and \textit{D. G. Kirkpatrick} [Graphs Comb.
Richard P. Anstee, Yunsun Nam
openaire   +3 more sources

Descending sequences of degrees

Journal of Symbolic Logic, 1975
Our unexplained notation is that of Rogers [4]. Let P ⊆ 2N × 2N. We call a sequence <An: n ∈ N> of subsets of N a P-sequence iff ∀n(An+1 = the unique B such that P(An, B)).Theorem. Let P ⊆ 2N × 2N be arithmetical. Then there is no P-sequence <An: n ∈ N> such that ∀n(A′n+1 ≤T An).This theorem improves a result of Friedman [2] who showed that
openaire   +3 more sources