Results 91 to 100 of about 110,665 (282)
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell are equidistant from $u$. Some properties and characterizations of such graphs are studied.
openaire +4 more sources
A bioorthogonal rhodamine/PEG crosslinking strategy is introduced to engineer dense collagen hydrogels with high mechanical resilience and cytocompatibility. Integration with wet‐spinning enables the fabrication of uniaxially aligned, cell‐laden collagen filaments that activate mechanotransductive signaling and support functional muscle regeneration in
JuYeon Kim +4 more
wiley +1 more source
On the graceful polynomials of a graph [PDF]
Every graph can be associated with a family of homogeneous polynomials, one for every degree, having as many variables as the number of vertices. These polynomials are related to graceful labellings: a graceful polynomial with all even coefficients is a
Andrea Vietri
core
Machine learning‐assisted surface‐enhanced Raman spectroscopy analysis of exosomal sialic acid for ovarian cancer diagnosis, as well as independent monitoring of exosomal sialic acid expression levels across different treatment periods, reveals a potential correlation with treatment response.
Lili Cong +6 more
wiley +1 more source
Graph polynomials from principal pivoting
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
GLANTZ R, PELILLO, Marcello
openaire +2 more sources
This review comprehensively summarizes the atomic defects in TMDs for their applications in sustainable energy storage devices, along with the latest progress in ML methodologies for high‐throughput TEM data analysis, offering insights on how ML‐empowered microscopy facilitates bridging structure–property correlation and inspires knowledge for precise ...
Zheng Luo +6 more
wiley +1 more source
Counting Polynomials on Regular Iterative Structures [PDF]
Subgraphs can results through application of criteria based on matrix which characterize the entire graph. The most important categories of criteria are the ones able to produce connected subgraphs (fragments). Theoretical frame on graph theory, a series
Lorentz JÄNTSCHI +2 more
doaj
Let G be a simple graph with adjacency matrix A and p(x) a polynomial with rational coefficients. If p(A) is a (0,1)-matrix, the graph whose adjacency matrix is p(A) is called a polynomial in G and is denoted by p(G). Polynomials in distance-regular graphs are determined in this paper. Automorphism groups and spectra of graphs and their polynomials are
openaire +1 more source
Reconfigurable Acoustofluidic Microvortices for Selective Microcargo Delivery
This work introduces a frequency‐encoded, reconfigurable acoustofluidic system that overcomes the low throughput and poor selectivity of conventional micro‐delivery methods. By exploiting discrete microbubble resonances to program adaptive microvortex modes, the platform enables real‐time switching and selective guidance of microscale payloads through ...
Lei Wang +6 more
wiley +1 more source
A Statistical Mechanics Model to Decode Tissue Crosstalk During Graft Formation
We introduce a statistical mechanics framework to decode the genomic crosstalk governing plant grafting. By integrating evolutionary game theory with transcriptomics, we reconstruct idopNetworks (informative, dynamic, omnidirectional, and personalized networks) that map scion–rootstock interactions.
Ang Dong +4 more
wiley +1 more source

