Results 51 to 60 of about 7,663 (277)
New attack on Kotzig's conjecture
Electronic Journal of Graph Theory and Applications, 2016 In this paper we study a technique to transform $\alpha $-labeled trees into $\rho $-labeled forests. We use this result to prove that the complete graph $K_{2n+1}$ can be decomposed into these types of forests.
Christian Barrientos, Sarah M. Minion
doaj +1 more source
Relationship between radio k-chromatic number of graphs and square graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a simple connected graph with diameter d(G) and k be a positive integer. A radio k-labeling of G is a function such that holds for each pair of distinct vertices u and v of G, where is the distance between u and v in G.
Laxman Saha
doaj +1 more source
Harmonious Labelings Via Cosets and Subcosets
Theory and Applications of Graphs, 2022 In [Abueida, A. and Roblee, K., More harmonious labelings of families of disjoint unions of an odd cycle and certain trees, J. Combin. Math. Combin. Comput., 115 (2020), 61-68] it is shown that the disjoint union of an odd cycle and certain paths is ...
Jared Painter +2 more
doaj +1 more source
An isoform of 14‐3‐3 protein regulates transbilayer lipid movement at the plasma membrane
FEBS Letters, EarlyView.Loss of 14‐3‐3ζ in CHO cells confers resistance to exogenous phosphatidylserine (PS) and impairs endocytosis‐independent inward flip‐flop of fluorescent PS at the plasma membrane. RNAi‐mediated knockdown reproduces this defect, while no additive effect is seen in ATP11C‐deficient cells.
Akiko Yamaji‐Hasegawa +3 more
wiley +1 more source
Graph labelings and their applications [PDF]
, 2019 Tato práce se zabývá aplikacemi ohodnocení grafů. Existují stovky článků o různých typech ohodnocení grafů. Mnoho odkazů na tyto články je evidováno v přehledovém článku J. A. Galliana.
Ziętek, Valdemar
core
Succinct Representation of Labeled Graphs [PDF]
Algorithmica, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barbay, Jérémy +3 more
openaire +4 more sources
Molecular Oncology, EarlyView.Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice +16 more
wiley +1 more source
Radio Graceful Labelling of Graphs
Theory and Applications of Graphs, 2020 Summary: Radio labelling problem of graphs have their roots in communication problem known as Channel Assignment Problem. For a simple connected graph \(G=(V(G),E(G))\), a radio labeling is a mapping \(f:V(G)\to \{0,1,2,\dots\}\) such that \(|f(u)-f(v)|\ge\text{diam}(G)+1-d(u,v)\) for each pair of distinct vertices \(u,v\in V(G)\), where \(\text{diam ...
Saha, Laxman, Basunia, Alamgir Rahaman
openaire +5 more sources
Minimal Sum Labeling of Graphs [PDF]
Journal of Discrete Algorithms, 2018 A graph $G$ is called a sum graph if there is a so-called sum labeling of $G$, i.e. an injective function $\ell: V(G) \rightarrow \mathbb{N}$ such that for every $u,v\in V(G)$ it holds that $uv\in E(G)$ if and only if there exists a vertex $w\in V(G)$ such that $\ell(u)+\ell(v) = \ell(w)$. We say that sum labeling $\ell$ is minimal if there is a vertex
Matěj Konečný +5 more
openaire +3 more sources
On H-antimagic decomposition of toroidal grids and triangulations
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a finite simple graph with p vertices and q edges. A decomposition of a graph G into isomorphic copies of a graph H is called (a, d)-H-antimagic if there is a bijection such that for all subgraphs isomorphic to H in the decomposition of G, the sum
Hendy +4 more
doaj +1 more source