Results 61 to 70 of about 251,114 (266)

Distance-Regular Graphs and Halved Graphs

European Journal of Combinatorics, 1986
Let G be a bipartite distance-regular graph with bipartition \(V(G)=X\cup Y\). Let \(V(G')=X\) and, for x and y in X, let x be adjacent to y in G' if and only if x is of distance two from y in G. Then G' is called a halved graph of G, and is distance-regular. This paper discusses whether G' is one of the known, large-diameter, distance-regular graphs.
openaire   +2 more sources

On the rotation distance of graphs

Discrete Mathematics, 1994
Let \(G\) be a simple undirected graph and suppose that \((x,y)\in E(G)\) and \((x,y')\not\in E(G)\). Then the rotation of \((x,y)\) about \(x\), denoted by \(r= (y,x,y')\) is the operation of removing \((x,y)\) and inserting \((x,y')\) as an edge. The resulting graph is denoted by \(G(r)\). A graph \(G\) can be rotated into a graph \(H\) if there is a
Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel   +4 more
openaire   +2 more sources

Stimulator of interferon genes agonist augmented antitumor immunity of osimertinib in Egfr‐mutated lung cancer

Molecular Oncology, EarlyView.
Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura, Tadahiro Kuribayashi, Johannes Brägelmann, Sachi Okawa, Masataka Taoka, Shunta Mori, Tomoka Nishimura, Takaaki Tanaka, Go Makimoto, Kiichiro Ninomiya, Kammei Rai, Eiki Ichihara, Ryohei Katayama, Katsuyuki Hotta, Masahiro Tabata, Yosuke Togashi, Yoshinobu Maeda, Martin L. Sos, Katsuyuki Kiura, Kadoaki Ohashi   +19 more
wiley   +1 more source

Distance perfectness of graphs

Discussiones Mathematicae Graph Theory, 1999
The author introduces a new generalization of perfect graphs. It turns out that the analogue of the weak perfect graph theorem is not true for this generalization. A subset \(Q\) of the vertex set \(V\) of a graph \(G\) is a \(k\)-distance clique in \(G\) if \(d_G(x,y)\leq k\) for any \(x,y\in Q\) and \(\langle Q\rangle_G\), the subgraph of \(G ...
openaire   +1 more source

Distance-hereditary graphs

Journal of Combinatorial Theory, Series B, 1986
A distance-hereditary graph is a connected graph in which every induced path is isometric, that is, the distance between any two vertices in an induced path equals their distance in the graph. A block graph is a conncted graph in which every block (i.e., maximal 2-connected subgraph) is complete. Let G be a graph with distance function d.
Hans-Jürgen Bandelt, Henry Martyn Mulder   +1 more
openaire   +1 more source

On the editing distance of graphs [PDF]

Journal of Graph Theory, 2008
AbstractAn edge‐operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\cal G$, the editing distance from G to $\cal G$ is the smallest number of edge‐operations needed to modify G into a graph from $\cal G$.
Maria Axenovich, André E. Kézdy, Ryan R. Martin   +2 more
openaire   +2 more sources

Tumor B‐cell infiltration in platinum‐treated advanced muscle‐invasive urothelial carcinoma

Molecular Oncology, EarlyView.
Bladder tumors with higher pretreatment memory B‐cell infiltration were linked to longer survival after cisplatin chemotherapy, but not carboplatin. These tumors also showed more organized immune structures (tertiary lymphoid structures) and a shared pro‐inflammatory B‐cell‐rich community, suggesting that memory B cells may help identify patients most ...
Konrad Stawiski, Júlia Perera‐Bel, Alejo Rodriguez‐Vida, Nuria Juanpere, Jihyun Lee, Daniel E. Michaud, Jennifer L. Guerriero, Kent W. Mouw, Aristotelis Bamias, Filipe L. F. Carvalho, Joaquim Bellmunt   +10 more
wiley   +1 more source

On distance-balanced graphs

European Journal of Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandar Ilic, Sandi Klavzar, Marjan Milanovic   +2 more
openaire   +1 more source

Spatial and single‐nuclei transcriptomics reveals idiosyncratic and generic patterns in papillary and anaplastic thyroid cancers

Molecular Oncology, EarlyView.
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur, Joel Rodrigues Vitória, Manuel Saiselet, Ligia Craciun, Denis Larsimont, Anne Lefort, Frédérick Libert, Carine Maenhaut, Sabine Costagliola, Maxime Tarabichi, Mirian Romitti, Vincent Detours   +11 more
wiley   +1 more source

Epigenetic silencing of the liver‐specific lncRNA LUNAR promotes liver cancer progression via NOTCH activation

Molecular Oncology, EarlyView.
LUNAR is a liver‐specific long noncoding RNA (lncRNA) that is highly expressed in normal liver but becomes epigenetically silenced in hepatocellular carcinoma through promoter hypermethylation. Loss of LUNAR is associated with NOTCH activation, epithelial–mesenchymal transition, and metastasis, whereas restoring LUNAR restrains metastatic progression ...
Se Ha Jang, Hyung Seok Kim, Geum Ok Baek, Moon Gyeong Yoon, Su In Lee, Jee‐Yeong Jeong, Ji Eun Han, Soon Sun Kim, Jae Youn Cheong, Jung Woo Eun   +9 more
wiley   +1 more source