Results 61 to 70 of about 1,619,561 (291)
Interval Valued Secondary k-Range Symmetric Quadri Partitioned Neutrosophic Fuzzy Matrices with Decision Making [PDF]
The objective of this study is to establish the results concerning Interval-Valued (IV) Secondary k-Range Symmetric (RS) Quadri Partitioned Neutrosophic Fuzzy Matrices (QPNFM).
K. Radhika +5 more
doaj +1 more source
Contribution of directedness in graph spectra
In graph analyses, directed edges are often approximated to undirected ones so that the adjacency matrices may be symmetric. However, such a simplification has not been thoroughly verified. In this study, we investigate how directedness affects the graph
Masaki Ochi, Tatsuro Kawamoto
doaj +1 more source
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley +1 more source
On the second minimizing graph in the set of complements of trees
Let G be a graph of order n and A(G)=[ai,j]be its adjacency matrix such that ai,j=1 if viis adjacent to vjand ai,j=0 otherwise, where 1≤i,j≤n. In a certain family of graphs, a graph is called minimizing (or second minimizing) if the least eigenvalue of ...
M. Javaid
doaj +1 more source
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 +13 more
wiley +1 more source
On Distinct Inertias of Lanzhou Matrices Versus Adjacency Matrices in Some Graph Classes
The Lanzhou matrix is a recently introduced graph matrix that depends on the adjacency relation and on the degrees of each vertex in the graph and its complement, thereby providing a spectral perspective on graph structure that differs from the classical
Madhumitha K. V. +3 more
doaj +1 more source
Minimum eigenvalue of the complement of tricyclic graphs with n-4 pendent vertexes
In order to discuss the minimum eigenvalue of adjacency matrix in the class of complementary graphs of the tricyclic graph with a given order of n and n-4 pendent vertexes, the unique graph whose minimum eigenvalue reaches the minimum is characterized ...
Hongjuan JU, Yingjie LEI
doaj +1 more source
Hierarchical data structures for flowchart
Flowcharts have broad applications in the fields of software development, engineering design, and scientific experimentation. Current flowchart data structure is mainly based on the adjacency list, cross-linked list, and adjacency matrix of the graph ...
Peng Zhang, Wenzhang Dou, Huaping Liu
doaj +1 more source
Reducing Rank of the Adjacency Matrix by Graph Modification
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Syed Mohammad Meesum +2 more
openaire +3 more sources
Loss of proton‐sensing TDAG8 increases tumor progression in mouse models of colon cancer
Loss of the pH‐sensing receptor TDAG8 accelerates colorectal cancer progression in mice. Animals lacking TDAG8 expression had increased tumor growth, DNA damage, and recruitment of tumor‐associated immune cells, including macrophages, neutrophils, and monocytes.
Ermanno Malagola +11 more
wiley +1 more source

