Results 91 to 100 of about 1,379,256 (326)
Journal of Mathematics, 2023 In this article, we adapt the edge-graceful graph labeling definition into block designs and define a block design V,B with V=v and B=b as block-graceful if there exists a bijection f:B⟶1,2,…,b such that the induced mapping f+:V⟶Zv given by f+x=∑x∈AA ...
Dilara Erdemir, Emre Kolotoğlu
doaj +1 more source
Super total graceful labeling of some trees
, 2021 A graph labeling is an assignment of integers to the edges, vertices, or both of a graph so that it meets to certain conditions. A graph labeling is called total labeling if labeling is given to edges and vertices.
I. N. Khasanah, Purwanto
semanticscholar +1 more source
Advanced Healthcare Materials, EarlyView.Most in vitro cancer models lack cellular diversity, functional complexity, and clinical relevance. This work highlights the generation of an innovative dynamic tetraculture with autologous patient‐derived cells within a vascularized tumor‐on‐chip, as well as the recapitulation of endothelial anergy features induced by the tumor microenvironment ...
Christine Lansche +16 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) +2 more
core
On Cubic Graceful Labeling [PDF]
, 2017 A graph with n vertex and m edges is said to be cubic graceful labeling if its vertices are labeled with distinct integers {0,1,2,3,……..,m3} such that for each edge f*( uv) induces edge mappings are {13,23,33,……,m3}.
, Mathew Varkey T. K, Mini. S. Thomas
core +2 more sources
Edge even graceful labeling of some corona graphs
, 2021 Elsonbaty and Daoud introduced a labeling of graph with p vertices and q edges called edge even graceful labeling i.e. a bijective function f of the edge set E(G) into the set {2,4,6, . . . , 2q} such that the induced function f*:V(G) → {0,2,4, . . ., 2k
D. Jayantara, Purwanto, S. Irawati
semanticscholar +1 more source
Thermoresponsive BrushGel Microcarriers for Efficient Cell Expansion and Enzyme‐Reduced Harvesting
Advanced Healthcare Materials, EarlyView.Askari et al, report on temperature‐responsive microcarriers to minimize enzyme use and cost in dynamic cultures. Abstract Scaling up cell therapy requires efficient expansion of high‐quality cells. Microcarrier(MC)‐based systems offer high surface‐to‐volume ratios and reduce culture media usage.
Esfandyar Askari +9 more
wiley +1 more source
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 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
Graceful Labeling Algorithms and Complexity – a Survey [PDF]
, 2011 Graceful graphs were first studied by Rosa in 1966. The Kotzig-Ringel graceful tree conjecture states that every tree has a graceful labeling. Aldred and McKay and others have used computer programs to show that trees of order up to 35 are graceful ...
Arumugam, S. (S), Bagga, J. (Jay)
core