Results 281 to 290 of about 1,679,013 (321)

Magnetic nanoparticle-based method for microorganism concentration in sterile body fluids: Validation and clinical applications. [PDF]

World J Microbiol Biotechnol
Tural B, Ertaş E, Uzuner N, Bektaş B, Tural E, Çavdar M, Temiz H, Özbek E, Tural S.   +8 more
europepmc   +1 more source

Consensus in the weighted voter model with noise-free and noisy observations. [PDF]

Swarm Intell
Ganesh A, Hauert S, Valla E.
europepmc   +1 more source

Brain tumor classification using GAN-augmented data with autoencoders and Swin Transformers. [PDF]

Front Med (Lausanne)
Almuhaimeed A, Bilal A, Alzahrani A, Alrashidi M, Alghamdi M, Sarwar R.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Lovász–Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs

Mathematical programming, 2016
We study the Lovász–Schrijver lift-and-project operator ($${{\mathrm{\text {LS}}}}_+$$LS+) based on the cone of symmetric, positive semidefinite matrices, applied to the fractional stable set polytope of graphs.
S. Bianchi, M. Escalante, G. Nasini, L. Tunçel   +3 more
semanticscholar   +2 more sources

Perfect Graphs for Domination Games

Annals of Combinatorics, 2019
Let γ(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma (G)$$\end{
Csilla Bujt'as, Vesna Iršič, S. Klavžar   +2 more
semanticscholar   +1 more source

Perfect codes in proper reduced power graphs of finite groups

, 2020
Let Γ be a graph with vertex set A subset C of is a perfect code of Γ if C is an independent set such that every vertex in is adjacent to exactly one vertex in C.
Xuanlong Ma
semanticscholar   +1 more source

Perfect quantum state transfer on diamond fractal graphs

Quantum Information Processing, 2019
In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one- dimensional cases, such as 1D spin chains.
Maxim S. Derevyagin, G. Dunne, Gamal Mograby, A. Teplyaev   +3 more
semanticscholar   +1 more source

The Structure of Bull‐Free Perfect Graphs

Journal of Graph Theory, 2013
The bull is a graph consisting of a triangle and two vertex‐disjoint pendant edges. A graph is called bull‐free if no induced subgraph of it is a bull. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H equals the size ...
M. Chudnovsky, Irena Penev
semanticscholar   +1 more source

The A-spectral radius and perfect matchings of graphs

Linear Algebra and its Applications, 2021
Yanhua Zhao, Xueyi Huang, Zhiwen Wang
semanticscholar   +1 more source