Results 41 to 50 of about 47,947 (303)
On cycles and paths in digraphs
Discrete Mathematics, 1980 AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and number of arcs to insure the existence of cycles and paths in directed graphs. We show that these results are the best possible. The proofs of the theorems can be found in [4].
openaire +1 more source
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 +3 more
wiley +1 more source
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
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
Long cycles in graphs without hamiltonian paths
, 2008 For a graph G, p(G) and c(G) denote the order of a longest path and a longest cycle of G, respectively. Bondy and Locke [J.A. Bondy, S.C. Locke, Relative length of paths and cycles in 3-connected graphs, Discrete Math. 33 (1981) 111–122] consider the gap
Yamashita, Tomoki +5 more
core +1 more source
Discrete Mathematics, 1974 AbstractRecently, Ramsey numbers have been obtained for several classes of graphs. In particular, they have been studied for graphs of low order, pairs of paths, pairs of cycles, and for a star and a path. In this paper, the Ramsey numbers are obtained for all path-cycle pairs.
Ralph J. Faudree +3 more
openaire +2 more sources
FEBS Open Bio, EarlyView.This paper reveals how human lactoferrin–albumin fusion (hLF‐HSA) potently suppresses lung adenocarcinoma cell migration. hLF‐HSA upregulates NHE7, leading to Golgi alkalization, disruption of the Golgi secretome, downregulation of MMP1, and reversal of EMT. These findings suggest a novel Golgi‐targeting strategy to suppress cancer cell migration.
Hana Nopia +3 more
wiley +1 more source
Edge ideals and DG algebra resolutions
Le Matematiche, 2015 Let R = S/I where S = k[T_1, . . . , T_n] and I is a homogeneous ideal in S. The acyclic closure R<Y> of k over R is a DG algebra resolution obtained by means of Tate’s process of adjoining variables to kill cycles.
Adam Boocher +4 more
doaj
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
On the Resolution of Path Ideals of Cycles [PDF]
Communications in Algebra, 2015 We give a formula to compute all the top degree graded Betti numbers of the path ideal of a cycle. Also we will find a criterion to determine when Betti numbers of this ideal are non zero and give a formula to compute its projective dimension and regularity.
Alilooee, Ali, Faridi, Sara
openaire +2 more sources