Results 61 to 70 of about 285,444 (268)
Summary: We define two 2-player impartial games on a simple graph called the Make-A-Cycle (\texttt{MAC}) game and the Avoid-A-Cycle (\texttt{AAC}) game. Given a simple graph \(\Gamma\) and starting vertex \(v\), two players alternate forming a path in \(\Gamma\) without backtracking.
Gates, Zachary +4 more
openaire +2 more sources
Discrete Mathematics, 1971 The paper is concerned with the existence of cycles of specified length in finite undirected graphs and with the question of how this depends on the numbers of vertices and edges in the graph. In particular, a conjecture of P. Erdos that every graph of order n and size at least 12(n^2-5n+14) has a cycle of length n-1 is proved.A lower bound for the ...
openaire +1 more source
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
High-Level Synthesis of DSP Applications Using Adaptive Negative Cycle Detection
EURASIP Journal on Advances in Signal Processing, 2002 The problem of detecting negative weight cycles in a graph is examined in the context of the dynamic graph structures that arise in the process of high level synthesis (HLS).
Nitin Chandrachoodan +2 more
doaj +1 more source
Cycle stochastic graphs: Structural and forbidden graph characterizations
AKCE International Journal of Graphs and Combinatorics, 2020 A vertex (respectively, edge) cycle stochastic function of a graph G is a labeling of vertices (respectively, edges) by a non-negative real valued function (respectively, ) such that for every cycle of G, the sum of labels of its vertices (respectively ...
S. B. Rao, U. K. Sahoo, V. Parameswaran
doaj +1 more source
Graphs with few hamiltonian cycles
Mathematics of Computation, 2019 We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number k ≥
Goedgebeur, Jan +2 more
openaire +2 more sources
COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells
Molecular Oncology, EarlyView.This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos +6 more
wiley +1 more source
Heavy Subgraph Conditions for Longest Cycles to Be Heavy in Graphs
Discussiones Mathematicae Graph Theory, 2016 Let G be a graph on n vertices. A vertex of G with degree at least n/2 is called a heavy vertex, and a cycle of G which contains all the heavy vertices of G is called a heavy cycle. In this note, we characterize graphs which contain no heavy cycles.
Lia Binlong, Zhang Shenggui
doaj +1 more source
Molecular Oncology, EarlyView.Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau +36 more
wiley +1 more source
A note on star coloring of central graph of bipartite graph and corona graph of complete graph with path and cycle [PDF]
Transactions on Combinatorics, 2012 In this paper, we find the star chromatic number of central graph of complete bipartite graph and corona graph of complete graph with path and cycle.
V. J. Vernold, M. Venkatachalam
doaj