Results 251 to 260 of about 912,801 (279)

Large Language Model Performance and Clinical Reasoning Tasks.

open access: yesJAMA Netw Open
Rao AS   +16 more
europepmc   +1 more source

Phenotypic and functional patterns of murine bone marrow-derived dendritic cells influenced by in vitro differentiation conditions. [PDF]

open access: yesPLoS One
Ionescu IE   +8 more
europepmc   +1 more source

Reducing Prime Graphs and Recognizing Circle Graphs

Combinatorica, 1987
A reduction theorem for prime (simple) graphs in \textit{W. H. Cunningham}'s sense [SIAM J. Algebraic Discrete Methods 3, 214-228 (1982; Zbl 0497.05031)] is presented. It says that every prime graph of order \(n>5\) contains a smaller prime graph of order n-1.
André Bouchet
exaly   +3 more sources

Editing to Prime Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Houmem Belkhechine, Cherifa Ben Salha
openaire   +1 more source

Hamiltonicity in Prime Sum Graphs

Graphs and Combinatorics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo
openaire   +3 more sources

A Graph of Primes

Mathematics Magazine, 1993
Some time ago a colleague asked me a question about the graph formed by associating a vertex with each prime, and placing an edge between each pair of primes whose difference in absolute value is a nonnegative power of 2. His question was whether the graph formed in this way is connected.
openaire   +2 more sources

A new concept of primeness in graphs

Networks, 1981
AbstractA graph is quasiprime with respect to a boolean product of graphs if whenever it is a subgraph of the product of two graphs, it must necessarily be isomorphic to a subgraph of one of its factors. This paper provides a characterization of graphs quasi‐prime with respect to cartesian product, as well as graphs quasiprime with respect to other ...
Roger H. Lamprey, Bruce H. Barnes
openaire   +2 more sources

Colouring prime distance graphs

Graphs and Combinatorics, 1990
Let \(D\) be a set of prime numbers. The prime distance graph \(Z(D)\) is the graph with integers as vertex set, and an edge between \(x\) and \(y\) precisely when \(|x-y| \in D\). Easily one obtains for the chromatic number \(\chi(D)\) of \(Z(D)\) that \(\chi(D) \leq 4\).
Roger B. Eggleton   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy