Results 91 to 100 of about 174,868,130 (283)
Regular graphs with high edge degree
AbstractFor any vertex x of a graph G let Δ(x) denote the set of vertices adjacent to x. We seek to describe the connected graphs G which are regular of valence n and in which for all adjacent vertices x and y |Δ(x) ∩ Δ(y)| = n − 1 − s. It is known that the complete graphs are the graphs for which s = 0. For any s, any complete many-partite graph, each
openaire +3 more sources
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
An experimental study of airfoil instability tonal noise with trailing edge serrations [PDF]
This paper presents an experimental study of the effect of trailing edge serrations on airfoil instability noise. Detailed aeroacoustic measurements are presented of the noise radiated by an NACA-0012 airfoil with trailing edge serrations in a low to ...
Joseph, PF, Chong, TP
core +1 more source
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source
KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS
The classical theorem of Vizing states that every graph of maximum degree $d$ admits an edge coloring with at most
ENDRE CSÓKA +2 more
doaj +1 more source
Edge coloring of graphs with small average degrees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rong Luo, Cun-Quan Zhang
openaire +3 more sources
Degree of vertices and number of edges in a mixed graph
In the study of a graph theory, degrees of vertices and number of edges are among the important theoretical terms that are helpful in showing discrete structures and their properties. This study attempts to present the relationship between number of edges and degrees of vertices in a mixed graph.
openaire +1 more source
Emerging experimental and computational methods for studying redox‐regulated structural transitions
Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass +2 more
wiley +1 more source
EDGE-NEIGHBOR RUPTURE DEGREE ON GRAPH OPERATIONS
Vulnerability and reliability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links in a communication network. An edge subversion strategy of a graph G, say , is a set of
Saadet Eskiizmirliler
core +1 more source
Synergistic perspectives—How single‐molecule biophysics complement biochemical understanding
In this review, we discuss how ensemble biochemistry and single‐molecule approaches are complementary, outline commonly used single‐molecule techniques, and illustrate their relevance through two representative case studies: chromatin organization by SMC complexes and pathway choice during DNA double‐strand break repair.
Sara De Bragança +2 more
wiley +1 more source

