Results 41 to 50 of about 395,936 (323)
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.
T. D. Parsons +3 more
openaire +3 more sources
Extrema property of the k-ranking of directed paths and cycles
AKCE International Journal of Graphs and Combinatorics, 2016 A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between.
Breeanne Baker Swart +3 more
doaj +1 more source
The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five
Mathematics, 2021 The main aim of the paper is to establish the crossing numbers of the join products of the paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the graph K1,1,3\e obtained by removing one edge e incident with some ...
Michal Staš
doaj +1 more source
FEBS Letters, EarlyView.Single‐cell RNA sequencing reveals an opposite role of SLPI in basal tumors based on metastatic spread, along with shared activation of specific regulons in cancer cells and mature luminal lactocytes, as well as downregulation of MALAT1 and NEAT1 in the latter.
Pietro Ancona +4 more
wiley +1 more source
Molecular Oncology, EarlyView.Analysis of treatment‐naïve high‐grade serous ovarian carcinoma (HGSOC) and control tissues for ERVs, LINE‐1 (L1), inflammation, and immune checkpoints identified five clusters with diverse patient recurrence‐free survivals. An inflammation score was calculated and correlated with retroelement expression, where one novel cluster (Triple‐I) with high ...
Laura Glossner +6 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
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
Partitioning edge-coloured complete graphs into monochromatic cycles and paths
, 2012 A conjecture of Erd\H{o}s, Gy\'arf\'as, and Pyber says that in any edge-colouring of a complete graph with r colours, it is possible to cover all the vertices with r vertex-disjoint monochromatic cycles. So far, this conjecture has been proven only for r
Alexey Pokrovskiy +10 more
core +1 more source
Molecular Oncology, EarlyView.Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra +10 more
wiley +1 more source