Results 31 to 40 of about 407,618 (322)
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
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
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
FEBS Letters, EarlyView.The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li +2 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
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
Complexity of Coloring Graphs without Paths and Cycles
, 2013 Let $P_t$ and $C_\ell$ denote a path on $t$ vertices and a cycle on $\ell$ vertices, respectively. In this paper we study the $k$-coloring problem for $(P_t,C_\ell)$-free graphs.
A. Brandstädt +16 more
core +1 more source
PICALM::MLLT10 translocated leukemia
FEBS Letters, EarlyView.This comprehensive review of PICALM::MLLT10 translocated acute leukemia provides an in‐depth review of the structure and function of CALM, AF10, and the fusion oncoprotein (1). The multifaceted molecular mechanisms of oncogenesis, including nucleocytoplasmic shuttling (2), epigenetic modifications (3), and disruption of endocytosis (4), are then ...
John M. Cullen +7 more
wiley +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