Results 261 to 270 of about 34,901 (303)

Matching Criterion for Identifiability in Sparse Factor Analysis. [PDF]

Psychometrika
Sturma N, Kranzlmueller M, Portakal I, Drton M.   +3 more
europepmc   +1 more source

Early Versus Delayed Laparoscopic Cholecystectomy in Acute Cholecystitis: A Comparative Study. [PDF]

Cureus
S D, Kumar A, Pasi DK, Singh J, Dhamija P, Kumar N.   +5 more
europepmc   +1 more source

Densities, Viscosities, and Self-Diffusion Coefficients of Sodium Chloride in Mixed Water-Polyethylene Glycol Solvents. [PDF]

J Chem Eng Data
Hoffmann MM, Janikas JC, Sanchez-Gamboni DE, Uzebu OO, Blose JM, Gutmann T, Buntkowsky G.   +6 more
europepmc   +1 more source

Continuous Emotion Recognition Using EDA-Graphs: A Graph Signal Processing Approach for Affective Dimension Estimation. [PDF]

Appl Sci (Basel)
Mercado-Diaz LR, Kong Y, Kundrát J, Posada-Quintero HF.   +3 more
europepmc   +1 more source

Primary Care Access and the Role of Telemedicine for Traditional Medicare Beneficiaries.

JAMA Health Forum
Ganguli I, Daley NE, Hicks A, Morgan KM, Mehrotra A, Cutler DM, Rosenthal MB.   +6 more
europepmc   +1 more source

On Triangle Contact Graphs

Combinatorics, Probability and Computing, 1994
It is proved that any plane graph may be represented by a triangle contact system, that is a collection of triangular disks which are disjoint except at contact points, each contact point being a node of exactly one triangle. Representations using contacts of T-or Y-shaped objects follow.
Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl   +2 more
core   +7 more sources

On degree sums of a triangle-free graph

Discrete Mathematics, 2014
For a simple triangle-free k-chromatic graph G with k >= 2 the upper bound m(n-f (k-2)) on the sum Sigma(2)(G) = Sigma(x is an element of V(G))d(2)(x) of the squares of the degrees of G is proved, where n, m, and f(1) are the order of G, the size of G,
Jochen Harant, Steffi Naumann
exaly   +3 more sources

Equistable graphs, general partition graphs, triangle graphs, and graph products

Discrete Applied Mathematics, 2011
In this paper we examine the connections between equistable graphs, general partition graphs and triangle graphs. While every general partition graph is equistable and every equistable graph is a triangle graph, not every triangle graph is equistable ...
Stefko Miklavic, Martin Milanič
exaly   +2 more sources