Results 71 to 80 of about 3,369,792 (260)

A Note on the Maximum Genus of Graphs with Diameter 4 [PDF]

, 2007
Let G be a simple graph with diameter four, if G does not contain complete subgraph K3 of order ...
WeiLi, He, Xiang, Ren, Lin, Zhao
core   +1 more source

Developmental programmes drive cellular plasticity, disease progression and therapy resistance in lung adenocarcinoma

Molecular Oncology, EarlyView.
This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska, Stephany Gallardo, Nur S. Zainal, Leena Arora, Matthew Ellis, Maria‐Antoinette Lopez, Judith Austine, Sai Pittla, Serena J Chee, Aiman Alzetani, Emily C Shaw, Christian H Ottensmeier, Gareth J Thomas, Christopher J Hanley   +13 more
wiley   +1 more source

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

Modular irregularity strength of dense graphs

Electronic Journal of Graph Theory and Applications
We solve the open problem posed in Modular irregularity strength of graphs, Electron. J. Graph Theory and Appl. 8 (2020), 435–433, asking about the modular irregularity strength of the complete graph Kn for all n ≥ 3.
I Nengah Suparta, Made Candiasa, Kadek Wahyu Prasancika, Martin Baca   +3 more
doaj   +1 more source

A Novel Approach for Neutrosophic Complete Graph and Neutrosophic Excellent Domination [PDF]

Neutrosophic Sets and Systems
Social networks have a crucial role in forming contemporary society. The way they operate and reach allow them to have a large-scale impact on beliefs, behaviours, and trust.
Murugan Raji, Ponnaiah Tharaniya, Surapati Pramanik, G. Ashwin Prabhu   +3 more
doaj   +1 more source

Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each

Discussiones Mathematicae Graph Theory, 2021
Let G be either a complete graph of odd order or a complete bipartite graph in which each vertex partition has an even number of vertices. In this paper, we determine the set of triples (p, q, r), with p, q, r > 0, for which there exists a decomposition ...
Shyu Tay-Woei
doaj   +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

Computation of the eigenvalues of complete signed graphs

Electronic Journal of Graph Theory and Applications
A signed graph Σ is the ordered pair (G,σ), where G=(V,E) is a finite simple graph, called the underlying graph, and σ: E(G) → {+1, -1} is a sign function or a signature of Σ. Let (K_n,σ) be a complete signed graph with n vertices. In this paper, we give
Shariefuddin Pirzada, Mir Riyaz Ul Rashid, Amir Rehman, Edy Tri Baskoro   +3 more
doaj   +1 more source

Graph Pattern Matching: From Intractable to Polynomial Time [PDF]

, 2010
Graph pattern matching is typically defined in terms of sub-graph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often too restrictive to characterize patterns in emerging applications. We propose
Li, Jianzhong, Tang, Nan, Ma, Shuai, Fan, Wenfei; id_orcid, Wu, Yunpeng, Wu, Yinghui   +5 more
core  

Decomposing complete equipartite graphs into short odd cycles [PDF]

, 2010
In this paper we examine the problem of decomposing the lexicographic product of a cycle with an empty graph into cycles of uniform length. We determine necessary and sufficient conditions for a solution to this problem when the cycles are of odd length.
Cavenagh, Nicholas J., Smith, Benjamin R.   +1 more
core   +1 more source