Results 161 to 170 of about 1,986,691 (177)

The transcriptional atlas, intercellular communication, and metabolic reprogramming of the cartilage and synovium in osteoarthritis patients with diabetes mellitus : a multiomics study. [PDF]

Bone Joint Res
Wen Y, Liu S, Chen H, Tu M, Zhao D, Xing J, Zheng W, Zhong Y, Wang H, Chen L.   +9 more
europepmc   +1 more source

Long-Term Outcomes of Mitral Valve Repair Versus Replacement in Patients with Ischemic Mitral Regurgitation: A Retrospective Propensity-Matched Analysis. [PDF]

J Cardiovasc Dev Dis
Elnagar IM, Alghamdi R, Alawami MH, Alshammari A, Almedimigh AA, Albabtain MA, AlGhamdi A, Ismail HH, Shalaby MA, Alotaibi KA, Arafat AA.   +10 more
europepmc   +1 more source

Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph. [PDF]

Brouwer, A.E., Haemers, W.H.
core  

Novel insights into immunopathogenesis and crucial biomarkers between primary open-angle glaucoma and systemic lupus erythematosus. [PDF]

IMetaOmics
Liu Y, You M, Zeng Z, Wang J, Rong R, Xia X.   +5 more
europepmc   +1 more source

Gut microbiota metabolite butyric acid alleviated <i>Klebsiella Pneumoniae</i> induced lung injury by regulating CX3CR1⁺NK via PI3K/AKT pathway. [PDF]

Burns Trauma
Mu S, Chang M, Shen Y, Wu X, Han Y, Xiang H, Luo Y, Chen Y, Zheng H, Song Z, Tong C.   +10 more
europepmc   +1 more source

Strongly regular decompositions of the complete graph. [PDF]

Dam, E.R. van
core  

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs [PDF]

Discrete Applied Mathematics, 2005
This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs ...
Ryuhei Uehara
exaly   +2 more sources

A characterization of strongly chordal graphs [PDF]

Discrete Mathematics, 1998
In this paper, we present a simple charactrization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more vertices has an induced triangle with exactly two edges of the triangle as the chords of the ...
Mirka Miller
exaly   +2 more sources

Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs [PDF]

Discrete Mathematics, 2003
Robert E. Jamison characterized chordal graphs by the edge set of every k-cycle being the symmetric difference of k−2 triangles. Strongly chordal (and chordal bipartite) graphs can be similarly characterized in terms of the distribution of triangles ...
Terry Allan McKee
exaly   +2 more sources