Results 81 to 90 of about 1,962,778 (284)
Structural Properties of the Cambrian Semilattices -- Consequences of Semidistributivity [PDF]
, 2015 The $\gamma$-Cambrian semilattices $\mathcal{C}_{\gamma}$ defined by Reading and Speyer are a family of meet-semilattices associated with a Coxeter group $W$ and a Coxeter element $\gamma\in W$, and they are lattices if and only if $W$ is finite.
Mühle, Henri
core
Prime Labeling of Rough Approximations for Some Special Graphs
, 2017 Background/Objectives: Rough set theory proposed a new mathematical approach to vagueness or imperfect knowledge. It is the learning of approximations of concepts represented by lower and upper approximations which is being attracted by many researchers.
S. Dhanalakshmi, N. Parvathi
semanticscholar +1 more source
Molecular Oncology, EarlyView.This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source
Molecular Oncology, EarlyView.This study indicates that Merkel cell carcinoma (MCC) does not originate from Merkel cells, and identifies gene, protein & cellular expression of immune‐linked and neuroendocrine markers in primary and metastatic Merkel cell carcinoma (MCC) tumor samples, linked to Merkel cell polyomavirus (MCPyV) status, with enrichment of B‐cell and other immune cell
Richie Jeremian +10 more
wiley +1 more source
Phenotypic Variation and Genetic Purity of the Original \u27Prime-Jim®\u27 x \u27Arapaho\u27 Population [PDF]
, 2017 In 2013, Castro et al., produced the first linkage map for primocane-fruiting blackberries using the cross ‘Prime-Jim®’ x ‘Arapaho.’ This mapping population has been maintained since the original experiment with the hopes of conducting future studies ...
Luther, Loren M
core +1 more source
Certain Results on Prime and Prime Distance Labeling of Graphs
Journal of Physics: Conference Series, 2020 Abstract Let G be a graph on n vertices. A bijective function f : V (G) → {1, 2,…,n} is said to be a prime labeling if for every e = xy, GCD{f (x),f (y)} = 1. A graph which permits a prime labeling is a “prime graph”. On the other hand, a graph G is a prime distance graph if there is an injective function g : V(G) → Z (the set of all ...
A. Parthiban, Ajaz Ahmad Pir, A. Felix
openaire +1 more source
Molecular Oncology, EarlyView.A comprehensive genomic and proteomic analysis of cervical cancer revealed STK11 and STX3 as a potential biomarkers of chemoradiation resistance. Our study demonstrated EGFR as a therapeutic target, paving the way for precision strategies to overcome treatment failure and the DNA repair pathway as a critical mechanism of resistance.
Janani Sambath +13 more
wiley +1 more source
Extending Undirected Graph Techniques to Directed Graphs via Category Theory
MathematicsWe use Category Theory to construct a ‘bridge’ relating directed graphs with undirected graphs, such that the notion of direction is preserved. Specifically, we provide an isomorphism between the category of simple directed graphs and a category we call ‘
Sebastian Pardo-Guerra +4 more
doaj +1 more source
Distinguishing Chromatic Number of Random Cayley graphs
, 2016 The \textit{Distinguishing Chromatic Number} of a graph $G$, denoted $\chi_D(G)$, was first defined in \cite{collins} as the minimum number of colors needed to properly color $G$ such that no non-trivial automorphism $\phi$ of the graph $G$ fixes each ...
Balachandran, Niranjan +1 more
core +1 more source
Prime labelings of infinite graphs
Involve, a Journal of Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kenigsberg, Matthew, Levin, Oscar
openaire +2 more sources