Results 51 to 60 of about 6,714 (280)

Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs

Theory and Applications of Graphs, 2020
In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj   +1 more source

Astrocyte Enrichment of 3D Cortical Constructs Enhances Brain Repair

Advanced Science, EarlyView.
This study highlights the role of astrocytes in supporting neural progenitor cell survival and differentiation after traumatic brain injury. Astrocytes enhanced neuronal differentiation, improved cell survival in co‐cultures, and promoted integration of microfluidics‐based implants with host tissue following implantation. Additionally, increased axonal
Elisa M. Cruz, Luana C. Soares, Gretchen Greene, Fernando Messore, Mohammed Abuelem, Mingyu Li, Caroline Andersen, Mirriam Domocos, Elisa Vitiello, Rabeah Abdul Razak, Marlene Lawston, Gabriel Moser, Talia Vasaturo‐Kolodner, Mona Barkat, Roslyn M. Bill, Edward Mann, Linna Zhou, Mootaz M. Salman, Hagan Bayley, Zoltán Molnár, Francis G. Szele   +20 more
wiley   +1 more source

Graceful and Odd Graceful Labeling of Some Graphs

International Journal of Mathematics and Soft Computing, 2013
In this paper, we prove that the square graph of bistar Bn,n, the splitting graph of Bn,n and the splitting graph of star K1,n are graceful graphs. We also prove that the splitting graph and the shadow graph of bistar Bn,n admit odd graceful labeling.
N. H. Shah, S. K. Vaidya
openaire   +1 more source

On graphs with α- and b-edge consecutive edge magic labelings

Indonesian Journal of Combinatorics, 2022
Among the most studied graph labelings we have the varieties called alpha and edge-magic. Even when their definitions seem completely different, these labelings are related.
Christian Barrientos
doaj   +1 more source

Heuristically Adaptive Diffusion‐Model Evolutionary Strategy

Advanced Science, EarlyView.
Building on the mathematical equivalence between diffusion models and evolutionary algorithms, researchers demonstrate unprecedented control over evolutionary optimization through conditional diffusion. By training diffusion models to associate parameters with specific traits, they can guide evolution toward solutions exhibiting desired behaviors ...
Benedikt Hartl, Yanbo Zhang, Hananel Hazan, Michael Levin   +3 more
wiley   +1 more source

Allogeneic Immune Cell Perfusion Inhibits the Growth of Vascularized 3D In Vitro Tumor Models, Induces Vascular Regression and Desmoplasia, but Promotes Tumor Cell Invasion

Advanced Science, EarlyView.
This study presents a vascularized 3D tumor model to investigate immune–stromal–tumor interactions under allogeneic PBMC perfusion. While immune cells induced tumor shrinkage, they also promoted vascular regression, stromal activation, and cancer cell invasion.
Alexandra Raab, Rasika Daware, Marcelo A. Szymanski de Toledo, Oskar Weber, Dimitris Kapsokalyvas, Twan Lammers, Horst Fischer, Federica De Lorenzi, Fabian Kiessling   +8 more
wiley   +1 more source

Pelabelan Graceful Sisi-ganjil Pada Graf Web W(2,n) [PDF]

, 2014
Let G = (V(G),E()) be a graph with vertex set () and edge set (). Assume that graph G have edge. Graceful edge-odd labeling is a bijective map ∶ () → {1, 3, 5,…,2 – 1} that resulting map + : () → {0,1,2,…,2 −1} with
Djuwandi, D. (Djuwandi), Ratnasari, L. (Lucia), Rizky, P. D. (Putri)   +2 more
core  

On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One

Journal of Applied Mathematics, 2016
A graceful labeling of a tree T with n edges is a bijection f:V(T)→{0,1,2,…,n} such that {|f(u)-f(v)|:uv∈E(T)} equal to {1,2,…,n}. A spider graph is a tree with at most one vertex of degree greater than 2. We show that all spider graphs with at most four
A. Panpa, T. Poomsa-ard
doaj   +1 more source

On the Graceful Cartesian Product of Alpha-Trees

Theory and Applications of Graphs, 2017
A \emph{graceful labeling} of a graph $G$ of size $n$ is an injective assignment of integers from the set $\{0,1,\dots,n\}$ to the vertices of $G$ such that when each edge has assigned a \emph{weight}, given by the absolute value of the difference of the
Christian Barrientos, Sarah Minion
doaj   +1 more source

Edge δ− Graceful Labeling for Some Cyclic-Related Graphs

Advances in Mathematical Physics, 2020
In this paper, we introduce a new type of labeling of a graph G with p vertices and q edges called edge δ− graceful labeling, for any positive integer δ, as a bijective mapping f of the edge set EG into the set δ,2δ,3δ,⋯,qδ such that the induced mapping ...
Mohamed R. Zeen El Deen
doaj   +1 more source