Results 31 to 40 of about 408,641 (276)
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Discussiones Mathematicae Graph Theory, 2020 Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once.
Lee Hung-Chih, Chen Zhen-Chun
doaj +1 more source
Exact Values for Some Size Ramsey Numbers of Paths and Cycles
Frontiers in Physics, 2020 For the graphs G1, G2, and G, if every 2-coloring (red and blue) of the edges of G results in either a copy of blueG1 or a copy of redG2, we write G → (G1, G2).
Xiangmei Li +3 more
doaj +1 more source
Roman domination number on cardinal product of paths and cycles
Croatian Operational Research Review, 2015 In this paper, the authors have determined certain upper and lower bounds for Roman domination numbers on cardinal products for any two graphs and some exact values for the cardinal product of paths and cycles.
Antoaneta Klobučar, Ivona Puljić
doaj +1 more source
The Square of Paths and Cycles
Journal of Combinatorial Theory, Series B, 1995 The square of a cycle (path) is the graph obtained by joining every pair of vertices of distance two in the cycle (path). Posa conjectured that if a graph \(G\) on \(n\) vertices has minimum degree \(\delta(G)\) at least \({2\over 3}n\), then \(G\) contains the square of a Hamiltonian cycle.
Fan, G.H., Kierstead, H.A.
openaire +1 more source
HYPER PATHS AND HYPER CYCLES [PDF]
International Journal of Pure and Apllied Mathematics, 2015 In graphs, paths are walks with no repeated vertex. A fortiori, paths cannot have any repeated edge. But in hypergraphs, hyperedges can re- peat in vertex-to-vertex walks without causing repetition of any vertex. This is the crux of the idea of generalizing paths and cycles (from graphs to hyper- graphs) presented in this short article.
R. Dharmarajan, K. Kannan
openaire +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.This study reveals a unique active site enriched in methionine residues and demonstrates that these residues play a critical role by stabilizing carbocation intermediates through novel sulfur–cation interactions. Structure‐guided mutagenesis further revealed variants with significantly altered product profiles, enhancing pseudopterosin formation. These
Marion Ringel +13 more
wiley +1 more source
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
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