Results 71 to 80 of about 166,020 (278)
The vertex-cover polynomial of a graph
Let \(G\) be an undirected graph without multiple edges but possibly with loops. By an \(r\)-vertex cover in \(G\) we mean an \(r\)-element subset of the vertex set which has a common vertex with every edge in \(G\). Let \(\text{ cv}(G,r)\) be the number of \(r\)-vertex covers in \(G\).
Feng Ming Dong +3 more
openaire +2 more sources
A STEGENOGRAPHY IN 3D MESH BY REARRANGING THE ORDER OF VERTEX PRESENTATION
This paper proposes a method of data hiding approach on 3D mesh objects in the representation domain by rearranging the order of the vertices based on a secret key string (a list vertex that was previously traversed as highly secret).
Thái Duy Quý
doaj +1 more source
New Concepts of Vertex Covering in Cubic Graphs with Its Applications
Graphs serve as one of the main tools for the mathematical modeling of various human problems. Fuzzy graphs have the ability to solve uncertain and ambiguous problems.
Huiqin Jiang +4 more
doaj +1 more source
Parameterized complexity of fair deletion problems
Deletion problems are those where given a graph $G$ and a graph property $\pi$, the goal is to find a subset of edges such that after its removal the graph $G$ will satisfy the property $\pi$. Typically, we want to minimize the number of elements removed.
Masařík, Tomáš, Toufar, Tomáš
core +1 more source
This paper presents a digital microfluidics‐based technique for transferring and reconfiguring soft nanomembranes. Laser‐machined nanothin membranes are picked up, transported, and aligned via tailored surface tension and the actuation of water droplets, enabling the development of flexible electronics, the integration of functional materials on 3D ...
Quang Anh Nguyen +15 more
wiley +1 more source
Statistical mechanics of the vertex-cover problem
We review recent progress in the study of the vertex-cover problem (VC). VC belongs to the class of NP-complete graph theoretical problems, which plays a central role in theoretical computer science.
Alexander K Hartmann +61 more
core +1 more source
MXene Wrapped Magnetic Mesocrystals for Durable Redox Catalytic Cancer Therapy and Responsive MRI
Conformal wrapping of ultrathin Ti3C2Tx MXene nanosheets on Fe3O4 mesocrystals creates topology‐stabilized Schottky junctions that direct photoinduced electron transfer under NIR irradiation. The unique architecture sustains Fenton catalysis, promotes continuous hydroxyl radical production, and provides photo‐responsive MRI contrast.
Min Jun Ko +10 more
wiley +1 more source
On the max min vertex cover problem [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BORIA, NICOLAS +2 more
openaire +3 more sources
We present a novel proteolysis‐targeting chimera (PROTAC) system conjugated to lipoic acid gold nanoclusters (PLANC), designed to degrade pTau, regulate inflammatory signaling, and effectively traverse the blood‐brain barrier (BBB). PLANC degraded pTau at various phosphorylation sites, with mechanistic studies confirming proteasome‐mediated degradation
Sarah Nevins +9 more
wiley +1 more source
Enumeration kernels for Vertex Cover and Feedback Vertex Set
Enumerative kernelization is a recent and promising area sitting at the intersection of parameterized complexity and enumeration algorithms. Its study began with the paper of Creignou et al. [Theory Comput. Syst., 2017], and development in the area has started to accelerate with the work of Golovach et al. [J. Comput. Syst. Sci., 2022].
Bougeret, Marin +3 more
openaire +3 more sources

