Results 91 to 100 of about 783,181 (348)

Characterization of perfect matching transitive graphs

Electronic Journal of Graph Theory and Applications, 2018
A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M and N of G, there is an automorphism f : V(G) ↦ V(G) such that fe(M) = N, where fe(uv) = f(u)f(v). In this paper, the author proposed the definition of PM-
Ju Zhou
doaj   +1 more source

Microfluidic Nano‐Assembly of Red‐Blood‐Cell (RBC) Lipids and Components for Engineering Extracellular Vesicles

Advanced Healthcare Materials, EarlyView.
Engineered red blood cell‐derived extracellular vesicles (eRBCEVs) are synthesized via controlled microfluidic assembly from native RBC lipids, enabling tunable encapsulation of proteins, nucleic acids, nanoparticles, and viral vectors. The platform demonstrates reproducible nanoscale architecture, preserved membrane composition, and functional cargo ...
Chiranth K. Nagaraj, Xilal Y. Rima, Kim T. Nguyen, Courtney Culkins, Nana Boateng, Jacob Doon‐Ralls, Alejandro Bresolin, Xin Huang, Hong Li, Vahedi Amid, Ajeet Pal Singh, Dharti Shantaram, Anastasiia Amari, Mangesh D. Hade, Nicholas R. Merriam, Zachary D. Schultz, Scott Q. Harper, Nizar Y. Saad, Setty M. Magaña, Willa A. Hsueh, Rachel E. Kopec, Blaise R. Kimmel, Andre F. Palmer, Eduardo Reátegui   +23 more
wiley   +1 more source

Square-free perfect graphs [PDF]

, 2004
We prove that square-free perfect graphs are bipartite graphs or line graphs of bipartite graphs or have a 2-join or a star ...
CONFORTI, MICHELANGELO, Conforti, Michele, Cornuéjols, Gérard, Gerard Cornuejols (3885373), Cornuejols, G, Michele Conforti (5455757), Kristina Vušković (5456237), Vuskovic, K, Cornuéjols, G., Vušković, Kristina, Conforti, M, Vuskovic, K.   +11 more
core   +1 more source

A Hybrid Bioprinting–Microfabrication Approach to Controllable Multitype Spheroid Arrays for Modeling Tumor Heterogeneity

Advanced Healthcare Materials, EarlyView.
This work introduces a “cancer‐in‐a‐well” technology that recreates tumor heterogeneity in vitro using multitype spheroid arrays. Combining bioprinting/microdispensing with microstructured culture devices, the system improves drug screening and modeling of tumor complexity.
Simone Bonetti, Eva Clemente, Emanuela Mensà, Marco de Maria, Fulvia Farabegoli, Emanuela Saracino, Barbara Bortolani, Emanuela Marcelli, Renato Brandimarti, Dario de Biase, Giampaolo Zuccheri   +10 more
wiley   +1 more source

Decomposing Berge graphs [PDF]

A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no old hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that ...
Nicolas Trotignon
core  

Perfect Roman {3}-Domination in Graphs: Complexity and Bound of Perfect Roman {3}-Domination Number of Trees

Journal of Mathematics
A perfect Roman 3-dominating function on a graph G=V,E is a function f:V⟶0,1,2,3 having the property that if fv=0, then ∑u∈Nvfu=3, and if fv=1, then ∑u∈Nvfu=2 for any vertex v∈V.
Ahlam Almulhim
doaj   +1 more source

Perfect Star Packings in (2,6)-Fullerene Graphs [PDF]

Mathematics Interdisciplinary Research
‎A (2,6)-fullerene graph is a planar and cubic graph with hexagonal and 2-length faces‎. ‎A perfect star packing is a spanning subgraph of a graph $G$ in which each component is isomorphic to the star graph $K_{1,3}$‎.
Meysam Taheri
doaj   +1 more source

NeuroVisio SyncPatch: A Skin‐Conformal Multimodal EMG–Motion Sensing Platform for Quantitative Neuromuscular Rehabilitation and Performance Monitoring

Advanced Healthcare Materials, EarlyView.
NeuroVisio SyncPatch integrates skin‐conformal electromyography (EMG) electrodes with camera‐tracked markers to jointly assess muscle activity and three‐dimensional knee kinematics during rehabilitation. Parallel feedback pathways provide real‐time kinematic guidance during movement and post‐trial neuromuscular feedback.
Bohyung Choi, Yoo‐Jin Jun, Heewon Choee, Kun‐Do Lee, Heesoo Kim, Yu Seok Hwang, Choong Yeon Kim, Seongok Chae, Juhyun Lee, Minkyu Je, Jae‐Woong Jeong, Hyung‐Soon Park   +11 more
wiley   +1 more source

Decomposing Berge graphs and detecting balanced skew partitions [PDF]

We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n9)-time algorithm for the same problem restricted to Berge graphs.
Nicolas Trotignon
core  

Reconstructibility and perfect graphs

Discrete Mathematics, 1983
AbstractIt is shown that the following classes of graphs are recognizable (i.e. looking at the point-deleted subgraphs of a graph G one can decide whether G belongs to that class or not): (1) perfect graphs, (2) triangulated graphs, (3) interval graphs, (4) comparability graphs, (5) split graphs.Furthermore we show the reconstructibility of (1 ...
openaire   +2 more sources