Results 71 to 80 of about 520,977 (330)
k-perfect geodominating sets in graphs [PDF]
A perfect geodominating set in a graph \(G\) is a geodominating set \(S\) such that any vertex \(v \in V(G)\setminus S\) is geodominated by exactly one pair of vertices of \(S\).
Doost Ali Mojdeh, Nader Jafari Rad
doaj
Binding Number, Toughness and General Matching Extendability in Graphs [PDF]
A connected graph $G$ with at least $2m + 2n + 2$ vertices which contains a perfect matching is $E(m, n)$-{\it extendable}, if for any two sets of disjoint independent edges $M$ and $N$ with $|M| = m$ and $|N|= n$, there is a perfect matching $F$ in $G ...
Hongliang Lu, Qinglin Yu
doaj +1 more source
Unleashing the Power of Machine Learning in Nanomedicine Formulation Development
A random forest machine learning model is able to make predictions on nanoparticle attributes of different nanomedicines (i.e. lipid nanoparticles, liposomes, or PLGA nanoparticles) based on microfluidic formulation parameters. Machine learning models are based on a database of nanoparticle formulations, and models are able to generate unique solutions
Thomas L. Moore +7 more
wiley +1 more source
Perfect State Transfer in Laplacian Quantum Walk [PDF]
For a graph $G$ and a related symmetric matrix $M$, the continuous-time quantum walk on $G$ relative to $M$ is defined as the unitary matrix $U(t) = \exp(-itM)$, where $t$ varies over the reals.
Alvir, R. +6 more
core
Mermin inequalities for perfect correlations
Any n-qubit state with n independent perfect correlations is equivalent to a graph state. We present the optimal Bell inequalities for perfect correlations and maximal violation for all classes of graph states with n < 7 qubits.
Adán Cabello +3 more
core +1 more source
Critical perfect graphs and perfect 3-chromatic graphs
AbstractThis paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to perfect graphs to obtain information about critical perfect graphs and related clique-generated graphs. Then we prove that Berge's Strong Perfect Graph Conjecture is valid for 3-chromatic graphs.
openaire +2 more sources
This review highlights how machine learning (ML) algorithms are employed to enhance sensor performance, focusing on gas and physical sensors such as haptic and strain devices. By addressing current bottlenecks and enabling simultaneous improvement of multiple metrics, these approaches pave the way toward next‐generation, real‐world sensor applications.
Kichul Lee +17 more
wiley +1 more source
Let G be a graph. The authors denote by \(\alpha_ N(G)\) the maximum number of edges of G such that no two of them belong to the same neighborhood subgraph of G (that is a subgraph induced by a vertex v and the vertices adjacent to v). They denote by \(\rho_ N(G)\) the minimum number of vertices whose neighborhood subgraphs cover the edge set of G.
Lehel, J, Tuza, Zs
openaire +1 more source
Nano‐ and Micro‐Sized Solid Materials Used as Antiviral Agents
Due to the rise of viral infections in humans and possible viral outbreaks, the use of nano‐ or micro‐sized materials as antiviral agents is rapidly increasing. This review explores their antiviral properties against RNA and DNA viruses, either as a prevention or a treatment tool, by delving into their mechanisms of action and how to properly assess ...
Orfeas‐Evangelos Plastiras +6 more
wiley +1 more source
Beyond the Edge: Charge‐Transfer Excitons in Organic Donor‐Acceptor Cocrystals
Complex excitonic landscapes in acene–perfluoroacene cocrystals are unveiled by polarization‐resolved optical spectroscopy and many‐body theory. This systematic study of a prototypical model system for weakly interacting donor–acceptor compounds challenges common views of charge‐transfer excitons, providing a refined conceptual framework for ...
Sebastian Anhäuser +6 more
wiley +1 more source

