Results 61 to 70 of about 2,253,480 (276)

Omega Index of Line and Total Graphs

open access: yesJournal of Mathematics, 2021
A derived graph is a graph obtained from a given graph according to some predetermined rules. Two of the most frequently used derived graphs are the line graph and the total graph.
Musa Demirci   +3 more
doaj   +1 more source

Aggressive prostate cancer is associated with pericyte dysfunction

open access: yesMolecular Oncology, EarlyView.
Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero   +11 more
wiley   +1 more source

Computing the forgotten topological index of four operations on graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2017
For a (molecular) graph, the first Zagreb index is equal to the sum of squares of the degrees of vertices, and the second Zagreb index is equal to the sum of the products of the degrees of pairs of adjacent vertices.
Shehnaz Akhter, Muhammad Imran
doaj   +1 more source

Minus total domination in graphs [PDF]

open access: yesCzechoslovak Mathematical Journal, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xing, Hua-Ming, Liu, Hai-Long
openaire   +2 more sources

In vitro models of cancer‐associated fibroblast heterogeneity uncover subtype‐specific effects of CRISPR perturbations

open access: yesMolecular 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

On Topological Indices of Total Graph and Its Line Graph for Kragujevac Tree Networks

open access: yesComplexity, 2021
Kragujevac tree is indicated by K; K∈Kgq=s2t+1+1,s with order and size s2t+1+1 and s2t+1, respectively. In this paper, we have a look at certain topological features of the total graph and line graph of the total graph of the considered tree, i.e ...
Salma Kanwal   +6 more
doaj   +1 more source

Dual targeting of RET and SRC synergizes in RET fusion‐positive cancer cells

open access: yesMolecular Oncology, EarlyView.
Despite the strong activity of selective RET tyrosine kinase inhibitors (TKIs), resistance of RET fusion‐positive (RET+) lung cancer and thyroid cancer frequently occurs and is mainly driven by RET‐independent bypass mechanisms. Son et al. show that SRC TKIs significantly inhibit PAK and AKT survival signaling and enhance the efficacy of RET TKIs in ...
Juhyeon Son   +13 more
wiley   +1 more source

Totally Silver Graphs

open access: yes, 2013
A totally silver coloring of a graph G is a k--coloring of G such that for every vertex v \in V(G), each color appears exactly once on N[v], the closed neighborhood of v. A totally silver graph is a graph which admits a totally silver coloring. Totally silver coloring are directly related to other areas of graph theory such as distance coloring and ...
Ghebleh, M., Mahmoodian, E. S.
openaire   +2 more sources

Methylation biomarkers can distinguish pleural mesothelioma from healthy pleura and other pleural pathologies

open access: yesMolecular Oncology, EarlyView.
We developed and validated a DNA methylation–based biomarker panel to distinguish pleural mesothelioma from other pleural conditions. Using the IMPRESS technology, we translated this panel into a clinically applicable assay. The resulting two classifier models demonstrated excellent performance, achieving high AUC values and strong diagnostic accuracy.
Janah Vandenhoeck   +12 more
wiley   +1 more source

A characterization of total graphs [PDF]

open access: yesProceedings of the American Mathematical Society, 1970
We consider “ordinary” graphs; that is, finite undirected graphs with no loops or multiple edges. The total graph T ( G ) T(G) of a graph G G is that graph whose vertex set is V ( G ) ∪ E ( G ) V(G) \cup E(G ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy