Results 111 to 120 of about 3,369,792 (260)
Discrete Mathematics, 2006 Let \(S= (S_1,\dots, S_n)\) be an out-degree vector of an orientation of a graph \(G\) with vertices \(1,\dots, n\). According to the partial order \(\succeq\) on the nonnegative integral vectors [see \textit{H. J. Ryser}, J. Algebra 10, 246--261 (1968; Zbl 0167.28001)] \(S^r_G\succeq S\succeq S^l_G\), \(\sum^n_{i=1} s_i= |E(G)|\) and \(0\leq s_i\leq ...
openaire +4 more sources
Optimal arrangement of data in a tree directory [PDF]
, 2001 We define the decision problem {\textsc {data arrangement}}, which involves arranging the vertices of a graph $G$ at the leaves of a $d$-ary tree so that a weighted sum of the distances between pairs of vertices measured with respect to the tree ...
Noble, S. D. +7 more
core +1 more source
Tumour‐proximal deep serum proteomics identifies biomarkers associated with ovarian cancer
Molecular Oncology, EarlyView.New biomarkers are needed for early ovarian cancer detection. Ovarian (tumour‐proximal) and peripheral vein serum from healthy women and patients with benign or malignant tumours underwent nanoparticle‐enriched deep proteomics. Ovarian serum yielded more protein identifications and revealed tumour‐reflective signatures.
Darren Lau +9 more
wiley +1 more source
Effects on Seidel energy of two special types of graphs by perturbing edges
Kuwait Journal of ScienceLet G be a simple undirected graph, and let S(G) be its Seidel matrix. The Seidel energy of G is defined as ES(G)=∑i=1n|λS(G)|, where λS(G),λS(G),…,λS(G) are Seidel eigenvalues of G.
doaj +1 more source
Complete graph immersions in dense graphs [PDF]
Discrete Mathematics, 2017 In this article we consider the relationship between vertex coloring and the immersion order. Specifically, a conjecture proposed by Abu-Khzam and Langston in 2003, which says that the complete graph with $t$ vertices can be immersed in any $t$-chromatic graph, is studied.
openaire +4 more sources
S-REGULAR CUBIC GRAPHS AS COVERINGS OF THE COMPLETE BIPARTITE GRAPH K-3,K-3
, 2004 A graph is s-regular if its automorphism group acts freely and transitively on the set of s-arcs. An infinite family of cubic 1-regular graphs was constructed in [10], as cyclic coverings of the three-dimensional Hypercube. In this paper, we classify the
Kwak, JH +3 more
core +1 more source
A new bound for the 2/3 conjecture [PDF]
, 2012 We show that any n-vertex complete graph with edges coloured with three colours contains a set of at most four vertices such that the number of the neighbours of these vertices in one of the colours is at least 2n/3.
Sereni, Jean-Sébastien +10 more
core +1 more source
Molecular Oncology, EarlyView.Cisplatin‐resistant cancer cells survive DNA‐damaging platinum‐based treatment yet remain sensitive to CuET‐induced proteotoxic stress. The distinct mechanism of action allows CuET to overcome and eliminate cisplatin‐resistant tumour cells, unless highly expressed metallothioneins (MTs) interfere with CuET, thereby highlighting MT levels as candidate ...
Stefanos Arampatzis +20 more
wiley +1 more source
Decompositions of Complete Multipartite Graphs into Complete Graphs
, 2011 Let $k\geq\ell\geq1$ and $n\geq 1$ be integers. Let $G(k,n)$ be the complete $k$-partite graph with $n$ vertices in each colour class. An $\ell$-decomposition of $G(k,n)$ is a set $X$ of copies of $K_k$ in $G(k,n)$ such that each copy of $K_\ell$ in $G(k,n)$ is a subgraph of exactly one copy of $K_k$ in $X$. This paper asks: when does $G(k,n)$ have an $
Fabila-Monroy, Ruy, Wood, David R.
openaire +2 more sources
FEBS Open Bio, EarlyView.The cytoskeleton‐mediated transport of mitochondria via tunnelling nanotubes restores respiration, increases ATP production, rescues cells from apoptosis, activates the AKT/mTOR signalling pathway, promotes cell migration and invasiveness, contributes to cancer progression and treatment resistance.
Stanislava Martínková, Jan Trnka
wiley +1 more source