Results 101 to 110 of about 39,392 (275)
Two Short Proofs on Total Domination
A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set.
Bickle Allan
doaj +1 more source
Extremal graphs without 4-cycles
We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q.
Firke, Frank A. +3 more
openaire +2 more sources
Dynamic Modulation of the Microenvironment Promotes Functional Maturation of Engineered Tissues
Engineered tissues lack the dynamic microenvironment of native tissues. A biocompatible, diffusible small molecule to dynamically modulate tissue microenvironments during maturation is used. Timing‐dependent modulation yields distinct outcomes, producing thicker, more native‐like blood vessels, stronger and more mature cardiac tissues, and optimized ...
Eric Silberman +7 more
wiley +1 more source
On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs
A cut-vertex in a graph G is a vertex whose removal increases the number of connected components of G. An end-block of G is a block with a single cut-vertex.
Wang Dingguo, Shan Erfang
doaj +1 more source
This review highlights recent advances in smart face masks that actively monitor breathing. By integrating humidity, gas, temperature, pressure, strain, and triboelectric sensors, these masks track key respiratory parameters in real time. The article summarizes sensor mechanisms, compares performance across studies, and discusses challenges and future ...
Negin Faramarzi +7 more
wiley +1 more source
This research shows the development of hydrogels with Diels‐Alder click chemistry for engineering cartilage‐like tissue. The hydrogels support cartilage spheroids which could be cultured for at least 28 days. Furthermore, the spheroids showed a tendency to fuse together into a more consistent construct, and produced important components needed for ...
Sanne M. van de Looij +8 more
wiley +1 more source
Extremal Graphs for Intersecting Triangles
A \(k\)-fan is a graph with \(2k+ 1\) vertices consisting of \(k\) 3-cycles having one vertex in common. The authors show that if \(n\geq 50k^2\) and the graph \(G_n\) has more than \([n^2/4]+ k^2- ck\) edges, where \(c\) equals 1 or 3/2 according as \(k\) is odd or even, then \(G_n\) contains a \(k\)-fan; furthermore, the bound for the number of edges
Erdos, P. +3 more
openaire +2 more sources
Adhesions’ high occurrence rates and high morbidity render them a critical challenge to be addressed. Current prevention methods, such as physical barriers, have many limitations, resulting in inconsistent safety and efficacy. This study demonstrates the potential for sprayable polymeric materials as an adhesion barrier.
Robert J. Morris III +7 more
wiley +1 more source
Ionizable lipid nanoparticles target multiple pathological pathways in neurodegeneration. The designed self‐assembled materials undergo a pH‐triggered structural transformation from a cubosome/hexosome coexistence to a hexosome phase, enhancing intracellular delivery of a multi‐target phytochemical formulation. The antioxidant‐loaded pH‐responsive LNPs
Thelma Akanchise +4 more
wiley +1 more source
Extremal Topological Indices with Prescribed Degree Sequences
This paper explores the extremal properties and bounds of two significant topological indices in graph theory: the Albertson and Sigma indices, with an emphasis on trees and bipartite graphs.
Hamoud, J., Belov, A.Ya.
doaj +1 more source

