Results 91 to 100 of about 196,583,728 (297)
On the maximum atom-bond sum-connectivity index of molecular trees
Let G be a graph with V(G) and E(G), as vertex set and edge set, respectively. The atom-bond sum-connectivity (ABS) index is a vertex-based topological index which is defined as [Formula: see text] where [Formula: see text] is the degree of the vertex a.
Zhonglin Cheng +2 more
doaj +1 more source
Beyond Primary Nucleation: Molecular Basis of Peptide Crystal Secondary Nucleation at Soft Interface
High spatiotemporal‐resolution atomic force microscopy directly resolved peptide secondary nucleation (SN) and growth characteristics and mechanisms on HOPG. The landscape of peptide nucleation sites, growth dynamics, molecular‐scale structures, phase transitions, and cross‐seeding processes were realized.
Linhao Sun +2 more
wiley +1 more source
Some Vertex/Edge-Degree-Based Topological Indices of r-Apex Trees
In chemical graph theory, graph invariants are usually referred to as topological indices. For a graph G, its vertex-degree-based topological indices of the form BIDG=∑uv∈EGβdu,dv are known as bond incident degree indices, where EG is the edge set of G ...
Liu, Jia-Bao +7 more
core +1 more source
Polymer‐coated IONPs functionalized with IL‐4 display respective neuroactive and anti‐inflammatory actions on neural progenitor cells and macrophages/microglia in vitro. When examined chronically in a rat experimental model of spinal cord injury, rGO scaffolds carrying these nanosystems adequately integrate into the lesion, significantly reduce ...
Julia Martínez‐Ramírez +12 more
wiley +1 more source
Degree of a Vertex in Complement of Modular Product of Intuitionistic Fuzzy Graphs [PDF]
In this paper, the complement of modular product of two intuitionistic fuzzy graphs is defined. The degree of a vertex in the complement of modular product of intuitionistic fuzzy graph is studied.
Yahya Mohamed, S, Mohamed Ali, A
core +1 more source
Spanning Trees whose Stems have a Bounded Number of Branch Vertices
Let T be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of T is denoted by Leaf(T).
Yan Zheng
doaj +1 more source
Degree conditions for vertex switching reconstruction
This paper is related to the \(s\)-vertex switching reconstruction problem. If \(G= G(V,E)\) is a graph and \(U \subset V\), the switching \(G_U\) of \(G\) is the graph obtained from \(G\) by replacing all the edges between \(U\) and \(V \backslash U\) with the nonedges.
openaire +2 more sources
CCL22‐releasing PLGA microparticles (MP) suspended in topically applied hydrogels (HEART) establish a sustained chemokine gradient at the injured myocardium. HEART recruits CCR4+ regulatory T cells, reduces infarct size and graft fibrosis, and improves cardiac function.
Matthew A. Borrelli +8 more
wiley +1 more source
Vertex-degree-based topological indices over trees with two branching vertices
: Given a graph G with n vertices, a vertex-degree-based topological index is defined from a set of real numbers {φij} as T I (G) = Pmij (G) φij , where mij (G) is the number of edges between vertices of degree i and degree j, and the sum runs over all 1
Rada Rincón, Juan Pablo +2 more
core +1 more source
Hemocompatible Glycogen‐Tissue Plasminogen Activator Complexes for Enhanced Blood Clot Dissolution
Glycogen–heparin‐cRGD nanoparticles enable targeted delivery of tissue plasminogen activator (tPA) to thrombi through activated platelet recognition. The hemocompatible hybrids minimize interactions with blood and immune cells while retaining enzymatic biodegradability.
Nadiia Davydiuk +6 more
wiley +1 more source

