Results 31 to 40 of about 45,382 (265)
Reducing the maximum degree of a graph by deleting vertices: the extremal cases
Theory and Applications of Graphs, 2018 Let $\lambda(G)$ denote the smallest number of vertices that can be removed from a non-empty graph $G$ so that the resulting graph has a smaller maximum degree. In a recent paper, we proved that if $n$ is the number of vertices of $G$, $k$ is the maximum
Peter Borg, Kurt Fenech
doaj +1 more source
Structure‐forward targeting of claudins with synthetic binders
FEBS Letters, EarlyView.Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley +1 more source
Degree resistance distance of unicyclic graphs [PDF]
Transactions on Combinatorics, 2012 Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [d(u)+d(v)] R(u,v), where d(u) is the degree of vertex u, and R(u,v) denotes the resistance distance ...
Ivan Gutman, Linhua Feng, Guihai Yu
doaj
A straightforward edge centrality concept derived from generalizing degree and strength
Scientific Reports, 2022 Vertex degree—the number of edges that are incident to a vertex—is a fundamental concept in network theory. It is the historically first and conceptually simplest centrality concept to rate the importance of a vertex for a network’s structure and ...
Timo Bröhl, Klaus Lehnertz
doaj +1 more source
Liver organoids: modelling complexity in homeostasis and disease
FEBS Letters, EarlyView.Studying liver in vitro has been challenging because simple 2D cell cultures fail to capture liver's cellular and architectural complexity. To bridge this gap, scientists increasingly use organoids, 3D liver models which better mimic liver composition and function. This review examines recent advances in liver organoid complexity and realism, discusses
Anna M. Dowbaj, Meritxell Huch
wiley +1 more source
On Domination Topological Indices of Graphs
International Journal of Analysis and Applications, 2020 Topological indices and domination in graphs are the essential topics in the theory of graphs. A set of vertices D ⊆ V (G) is said to be a dominating set for G if any vertex v ∈ V − D is adjacent to some vertex u ∈ D.
A.M. Hanan Ahmed +2 more
doaj
Comparing the paths of Hedgehog release in artificial and natural settings
FEBS Letters, EarlyView.Hh morphogens require solubilization factors to overcome their tight association with the plasma membrane and signal to distant cells, but the precise functions of these factors are controversial. Here, we use published in vivo observations as the most relevant evidence to test their suggested functions and discuss contradictions and gaps between in ...
Janna Puschmann, Kay Grobe
wiley +1 more source
Angle Covers: Algorithms and Complexity
Journal of Graph Algorithms and Applications, 2021 Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering- an angle- such that each edge ...
William Evans +3 more
doaj +1 more source
Study on Bipolar Single-Valued Neutrosophic Graphs With Novel Application [PDF]
Neutrosophic Sets and Systems, 2020 Unipolar is less fundamental than bipolar cognition based on truth, and composure is a restraint for truth-based worlds. Bipolarity is the most powerful phenomenon that survives when truth disappeared in a black hole due to Hawking radiation or ...
M. Aslam Malik +5 more
doaj +1 more source
CEACAM1 participation in breast cancer progression
Molecular Oncology, EarlyView.In invasive breast cancer (BC), CEACAM1 shifts from an apical to a uniform membranous/cytoplasmic pattern, or is lost, as tumors dedifferentiate, inversely tracking the Ki‐67 proliferative index. In MCF‐7 cells, only CEACAM1‐4L suppresses proliferation, repressing cell cycle and growth factor genes.
Mykola Lyndin +3 more
wiley +1 more source