Results 51 to 60 of about 1,946,730 (334)

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

Line graph embedding of co-intersection graph of ideals of commutative rings

open access: yesAKCE International Journal of Graphs and Combinatorics
This research paper focuses on the co-intersection graph of a commutative ring [Formula: see text]. The co-intersection graph of [Formula: see text] denoted by [Formula: see text] is a simple graph with vertices that are non-trivial ideals of [Formula ...
Ali Al Khabyah   +4 more
doaj   +1 more source

Characterization of Line-Consistent Signed Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2015
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e.
Slilaty Daniel C., Zaslavsky Thomas
doaj   +1 more source

The line completion number of hypercubes

open access: yesAKCE International Journal of Graphs and Combinatorics, 2019
In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index r of a graph G, denoted by ℒr(G). The vertices of ℒr(G)are the r-subsets of E(G), and two vertices S and T are adjacent if there exist s∈S and t∈T such that s and ...
S.A. Tapadia, B.N. Waphare
doaj   +1 more source

Reverse Line Graph Construction: The Matrix Relabeling Algorithm MARINLINGA Versus Roussopoulos's Algorithm [PDF]

open access: yes, 2010
We propose a new algorithm MARINLINGA for reverse line graph computation, i.e., constructing the original graph from a given line graph. Based on the completely new and simpler principle of link relabeling and endnode recognition, MARINLINGA does not ...
Liu, D.   +2 more
core  

The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity

open access: yesFEBS Letters, EarlyView.
The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley   +1 more source

Multi-Line Geometry of Qubit-Qutrit and Higher-Order Pauli Operators [PDF]

open access: yes, 2007
The commutation relations of the generalized Pauli operators of a qubit-qutrit system are discussed in the newly established graph-theoretic and finite-geometrical settings.
A. Blunck   +14 more
core   +4 more sources

On hamiltonian line-graphs [PDF]

open access: yesTransactions of the American Mathematical Society, 1968
Introduction. The line-graph L(G) of a nonempty graph G is the graph whose point set can be put in one-to-one correspondence with the line set of G in such a way that two points of L(G) are adjacent if and only if the corresponding lines of G are adjacent.
openaire   +1 more source

Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10

open access: yesFEBS Letters, EarlyView.
Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang   +8 more
wiley   +1 more source

A note on co-maximal graphs of commutative rings

open access: yesAKCE International Journal of Graphs and Combinatorics, 2018
Let R be a commutative ring with unity. The co-maximal graph Γ ( R ) is the graph with vertex set R and two vertices a and b are adjacent if R a + R b = R .
Deepa Sinha, Anita Kumari Rao
doaj   +1 more source

Home - About - Disclaimer - Privacy