Results 41 to 50 of about 270,997 (279)

Clique complexes and graph powers

open access: yes, 2012
We study the behaviour of clique complexes of graphs under the operation of taking graph powers. As an example we compute the clique complexes of powers of cycles, or, in other words, the independence complexes of circular complete graphs.Comment: V3 ...
Adamaszek, Michal
core   +1 more source

On strongly chordal graphs that are not leaf powers

open access: yes, 2017
A common task in phylogenetics is to find an evolutionary tree representing proximity relationships between species. This motivates the notion of leaf powers: a graph G = (V, E) is a leaf power if there exist a tree T on leafset V and a threshold k such ...
A Brandstädt   +18 more
core   +1 more source

The power graph of a torsion-free group determines the directed power graph [PDF]

open access: yesDiscrete Applied Mathematics, 2021
The directed power graph $\vec{\mathcal G}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph of $\mathbf G$, denoted with $\mathcal G(\mathbf G)$, is the underlying simple graph. In this paper, for groups $\mathbf G$ and $\mathbf H$, the following is proved.
openaire   +3 more sources

Graph Powering and Spectral Robustness

open access: yesSIAM Journal on Mathematics of Data Science, 2020
Spectral algorithms, such as principal component analysis and spectral clustering, typically require careful data transformations to be effective: upon observing a matrix $A$, one may look at the spectrum of $ (A)$ for a properly chosen $ $. The issue is that the spectrum of $A$ might be contaminated by non-informational top eigenvalues, e.g., due to
Abbe, Emmanuel   +3 more
openaire   +2 more sources

Invariant measures for Cartesian powers of Chacon infinite transformation

open access: yes, 2017
We describe all boundedly finite measures which are invariant by Cartesian powers of an infinite measure preserving version of Chacon transformation. All such ergodic measures are products of so-called diagonal measures, which are measures generalizing ...
De La Rue, Thierry   +2 more
core   +3 more sources

Enteropathogenic E. coli shows delayed attachment and host response in human jejunum organoid‐derived monolayers compared to HeLa cells

open access: yesFEBS Letters, EarlyView.
Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi   +5 more
wiley   +1 more source

Transferrin receptor 1‐mediated iron uptake supports thermogenic activation in human cervical‐derived adipocytes

open access: yesFEBS Letters, EarlyView.
In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai   +9 more
wiley   +1 more source

The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation

open access: yesJournal of Applied Mathematics, 2012
Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we consider one type of directed graph. Then we obtain a general form of the adjacency matrices of the graph.
Fatih Yılmaz, Durmuş Bozkurt
doaj   +1 more source

Ligand Binding Prediction Using Protein Structure Graphs and Residual Graph Attention Networks

open access: yesMolecules, 2022
Computational prediction of ligand–target interactions is a crucial part of modern drug discovery as it helps to bypass high costs and labor demands of in vitro and in vivo screening.
Mohit Pandey   +6 more
doaj   +1 more source

Boxicity and Cubicity of Product Graphs

open access: yes, 2013
The 'boxicity' ('cubicity') of a graph G is the minimum natural number k such that G can be represented as an intersection graph of axis-parallel rectangular boxes (axis-parallel unit cubes) in $R^k$.
Chandran, L. Sunil   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy