Results 61 to 70 of about 4,376,990 (279)

Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
The generalized k-connectivity κk(G) of a graph G was introduced by Hager in 1985. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G) = min{λ(S) : S ⊆ V (G) and |
Sun Yuefang
doaj   +1 more source

Ergodic Theorems for Lower Probabilities

open access: yes, 2015
We establish an Ergodic Theorem for lower probabilities, a generalization of standard probabilities widely used in applications.
Cerreia-Vioglio, Simone   +2 more
core   +1 more source

Enteropathogenic E. coli shows delayed attachment and host response in human jejunum organoid‐derived monolayers compared to HeLa cells

open access: yesFEBS Letters, EarlyView.
Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi   +5 more
wiley   +1 more source

Strong Convergence in a Product Space [PDF]

open access: yesProceedings of the American Mathematical Society, 1962
The purpose of this note is to present a certain necessary and sufficient condition for strong convergence in Lp over a product space. This result is formulated as Theorem 1 below. Theorem 1 includes as a special case a well-known compactness condition of M. Riesz, which we state in slightly different form as Theorem 2.
openaire   +1 more source

2-Tone Colorings in Graph Products

open access: yesDiscussiones Mathematicae Graph Theory, 2015
A variation of graph coloring known as a t-tone k-coloring assigns a set of t colors to each vertex of a graph from the set {1, . . . , k}, where the sets of colors assigned to any two vertices distance d apart share fewer than d colors in common.
Loe Jennifer   +3 more
doaj   +1 more source

Pseudo MV-algebras and Lexicographic Product [PDF]

open access: yes, 2014
We study algebraic conditions when a pseudo MV-algebra is an interval in the lexicographic product of an Abelian unital $\ell$-group and an $\ell$-group that is not necessary Abelian.
Dvurečenskij, Anatolij
core  

Organoids in pediatric cancer research

open access: yesFEBS Letters, EarlyView.
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley   +1 more source

若干运算图的倍乘赋权Harary指标(Multiplicatively weighted Harary index of some graph operations)

open access: yesZhejiang Daxue xuebao. Lixue ban, 2017
Recently, ALIZADEH et al proposed a modification of the Harary index in which the contributions of vertex pairs were weighted by the product of their degrees.
WENYanqing(温艳清)   +2 more
doaj   +1 more source

Various Product on Multi Fuzzy Graphs

open access: yesRatio Mathematica, 2022
In this paper, the definition of complement of multi fuzzy graph, direct sum of two multi fuzzy graphs are given and derived some theorems related to them.
R Muthuraj, K Krithika, S Revathi
doaj   +1 more source

Dominating sequences in grid-like and toroidal graphs [PDF]

open access: yes, 2016
A longest sequence $S$ of distinct vertices of a graph $G$ such that each vertex of $S$ dominates some vertex that is not dominated by its preceding vertices, is called a Grundy dominating sequence; the length of $S$ is the Grundy domination number of $G$
Brešar, Boštjan   +7 more
core   +1 more source

Home - About - Disclaimer - Privacy