Results 41 to 50 of about 408,641 (276)

Monochromatic Path and Cycle Partitions in Hypergraphs [PDF]

The Electronic Journal of Combinatorics, 2013
Here we address the problem to partition edge colored hypergraphs by monochromatic paths and cycles generalizing a well-known similar problem for graphs.We show that $r$-colored $r$-uniform complete hypergraphs can be partitioned into monochromatic Berge-paths of distinct colors. Also, apart from $2k-5$ vertices, $2$-colored $k$-uniform hypergraphs can
Gyárfás, András, Sárközy, Gábor N.
openaire   +2 more sources

Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment

Molecular Oncology, EarlyView.
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley   +1 more source

Edge magic total labeling of lexicographic product C4(2r+1) o ~K2 cycle with chords, unions of paths, and unions of cycles and paths

Indonesian Journal of Combinatorics, 2018
An edge magic total (EMT) labeling of a graph G = (V, E) is a bijection from the set of vertices and edges to a set of numbers defined by λ : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} with the property that for every xy ∈ E, the weight of xy equals to a constant k,
Inne Singgih
doaj   +1 more source

Revisiting Path Contraction and Cycle Contraction

Journal of Computer and System Sciences
The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge contractions in $G$. We revisit these NP-complete problems and prove the following results. Path Contraction admits
Krithika, R., Malu, V. K. Kutty, Tale, Prafullkumar   +2 more
openaire   +2 more sources

Turán problems and shadows I: Paths and cycles

Journal of Combinatorial Theory, Series A, 2015
A $k$-path is a hypergraph P_k = e_1,e_2,...,e_k such that |e_i \cap e_j| = 1 if |j - i| = 1 and e_i \cap e_j is empty otherwise. A k-cycle is a hypergraph C_k = e_1,e_2,.. ,e_k obtained from a (k-1)-path e_1,e_2,...,e_{k-1} by adding an edge e_k that shares one vertex with e_1, another vertex with e_{k-1} and is disjoint from the other edges. Let ex_r(
Kostochka, Alexandr, Mubayi, Dhruv, Verstraëte, Jacques   +2 more
openaire   +2 more sources

Raman‐based label‐free microscopic analysis of the pancreas in living zebrafish larvae

FEBS Open Bio, EarlyView.
Forward stimulated Raman scattering (F‐SRS) and epi coherent anti‐Stokes Raman scattering (E‐CARS) allow label‐free discrimination of distinct subcellular structures in the pancreas of living zebrafish larvae. Given the straightforward applicability, we anticipate broad implementation of Raman microscopy in other organs and across various biomedical ...
Noura Faraj, Eline M. F. de Lange, Klaas A. Sjollema, Ben N. G. Giepmans   +3 more
wiley   +1 more source

Simple Paths and Cycles of Directed Graph for Stock Trading Network Based on STP

Journal of Mathematics, 2022
The stock trading relationship of buyers and sellers in the stock market can be characterized by a directed graph. It is an important way to study stock trading network through simple directed paths and cycles.
Xiaolong Liu, Li Ma
doaj   +1 more source

Heavy paths and cycles in weighted graphs [PDF]

, 1998
A weighted graph is a graph in which each edge e is assigned a non-negative\ud number $w(e)$, called the weight of $e$. In this paper, some theorems on the\ud existence of long paths and cycles in unweighted graphs are generalized to heavy\ud paths and ...
Broersma, H.J., Li, X., Zhang, S.
core   +1 more source

YlmG1 is localized exclusively to the chloroplast envelope membrane and is involved in preprotein translocation in Arabidopsis thaliana

FEBS Open Bio, EarlyView.
Cytosolically synthesized chloroplast preproteins are translocated across the outer and inner envelope membranes through translocons called TOC and TIC, respectively. In green algae and plants, the TIC core is composed of essential membrane proteins, Tic12, Tic20, and Tic214.
Mengyi Li, Xueyang Zhao, Masato Nakai
wiley   +1 more source

Γ-independent dominating graphs of paths and cycles [PDF]

Songklanakarin Journal of Science and Technology (SJST)
A set D of vertices in a graph G is an independent dominating set if D is a set of pairwise nonadjacent vertices of G such that every vertex of G not in D is adjacent to at least one vertex in D.
Roongrat Samanmoo, Nantapath Trakultraipruk   +1 more
doaj