Results 61 to 70 of about 38,756 (312)
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
Rainbow perfect domination in lattice graphs
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
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
We report a polymer‐chain insertion strategy to fabricate pore‐threaded MOF thin films with precisely tuned surface chemistry and wettability. Grafting n‐alkane chains into the pillared layer Cu2(bdc)2(dabco) MOF thin film's vertical nanochannels enhances water stability, and induces hydrophobicity and lubricant‐free, solid‐like slippery behavior ...
Angana Borbora +4 more
wiley +1 more source
Perfect Roman and Perfect Italian Domination of Cartesian Product Graphs
For a graph G=(V,E), a function f:V→{0,1,2} is a perfect Roman dominating function (PRDF) on G if every v∈V with f(v)=0 is adjacent to exactly one vertex u with f(u)=2. The sum ∑_(v∈V)^▒f (v) is the weight w(f) of f.
Ahlam Almulhim
doaj +1 more source
AbstractThe class ofβ-perfect graphs is introduced. We draw a number of parallels between these graphs and perfect graphs. We also introduce some special classes ofβ-perfect graphs. Finally, we show that the greedy algorithm can be used to colour a graphGwith no even chordless cycles using at most 2(χ(G)−1) colours.
Markossian, S.E. +2 more
openaire +1 more source
Amyloidogenic Peptide Fragments Designed From Bacterial Collagen‐like Proteins Form Hydrogel
This study identified amyloidogenic sequence motifs in bacterial collagen‐like proteins and exploited these to design peptides that self‐assemble into β‐sheet fibers and form hydrogels. One hydrogel supported healthy fibroblast growth, showing promise for biocompatible materials. Our work demonstrates that bacterial sequences can be harnessed to create
Vamika Sagar +5 more
wiley +1 more source
Integral sum graphs Gn and G-r,n are perfect graphs
A 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
Bioprinting Organs—Science or Fiction?—A Review From Students to Students
Bioprinting artificial organs has the potential to revolutionize the medical field. This is a comprehensive review of the bioprinting workflow delving into the latest advancements in bioinks, materials and bioprinting techniques, exploring the critical stages of tissue maturation and functionality.
Nicoletta Murenu +18 more
wiley +1 more source

