Results 71 to 80 of about 39,180 (264)
Rainbow perfect domination in lattice graphs
Electronic Journal of Graph Theory and Applications, 2018 Let 0 < n ∈ Z. In the unit distance graph of Zn ⊂ Rn, a perfect dominating set is understood as having induced components not necessarily trivial.
Luis R. Fuentes +2 more
doaj +1 more source
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 +23 more
wiley +1 more source
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
Advanced Healthcare Materials, EarlyView.Gonzalez Martinez and collaborators develop a strategy to formulate high performance GelMA‐based bioinks with low solids contents. The resulting bioinks enable 3D bioprinting at 37 °C of high‐fidelity structures with tunable mechanical properties that support high cell viability and function.
David A. González‐Martínez +8 more
wiley +1 more source
Integral sum graphs Gn and G-r,n are perfect graphs
AKCE International Journal of Graphs and CombinatoricsA graph G is an integral sum graph (sum graph) if its vertices can be labeled with distinct integers (positive integers) so that e = uv is an edge of G if and only if the sum of the labels on vertices u and v is also a label in G. A graph G is perfect if
Julia K. Abraham +4 more
doaj +1 more source
Advanced Healthcare Materials, EarlyView.We introduce a new fabrication method that overcomes the current limitation of tubular gap electrospinning. We successfully fabricated a seamless hollow tube with fibers aligned along the longitudinal axis in diameters as small as 300 µm, and then reinforced it using 4‐axis 3D printing.
Seyed Aliakbar Hosseini Toopghara +9 more
wiley +1 more source
Journal of MathematicsA 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
Distance perfectness of graphs
Discussiones Mathematicae Graph Theory, 1999 The author introduces a new generalization of perfect graphs. It turns out that the analogue of the weak perfect graph theorem is not true for this generalization. A subset \(Q\) of the vertex set \(V\) of a graph \(G\) is a \(k\)-distance clique in \(G\) if \(d_G(x,y)\leq k\) for any \(x,y\in Q\) and \(\langle Q\rangle_G\), the subgraph of \(G ...
openaire +1 more source
Advanced Materials, EarlyView.AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
Perfection thickness of graphs
Discrete Mathematics, 2000 For a graph \(G\), let \(f(G)\) be the least number of perfect subgraphs of \(G\) whose union is \(G\). Let \(f(n)= \max\{f(G):|V(G)|= n\}\). Improving results of Zs. Tuza, the authors prove that \[ \textstyle{{1\over 2}}(\log n-\log\log n- O(1))\leq f(n)\leq \lceil\log n\rceil, \] where \(\log\) denotes the base-2 logarithm.
Hirotsugu Asari +3 more
openaire +2 more sources