Results 51 to 60 of about 712,475 (276)

Completion of the mixed unit interval graphs hierarchy

open access: yes, 2017
We describe the missing class of the hierarchy of mixed unit interval graphs, generated by the intersection graphs of closed, open and one type of half-open intervals of the real line.
Kratochvíl, Jan, Talon, Alexandre
core   +2 more sources

$K_3$-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum [PDF]

open access: yes, 2015
A $K_3$-WORM coloring of a graph $G$ is an assignment of colors to the vertices in such a way that the vertices of each $K_3$-subgraph of $G$ get precisely two colors. We study graphs $G$ which admit at least one such coloring.
Bujtás, Csilla, Tuza, Zsolt
core   +3 more sources

Generalized Spectral Characterization of Mixed Graphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2020
The spectral characterization of graphs is an important topic in spectral graph theory, which has been studied extensively in recent years. Unlike the undirected case, however, the spectral characterization of mixed graphs (digraphs) has received much less attention so far, which will be the main focus of this paper.
Wei Wang 0195   +3 more
openaire   +3 more sources

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

Unit Mixed Interval Graphs [PDF]

open access: yes, 2014
In this paper we extend the work of Rautenbach and Szwarcfiter by giving a structural characterization of graphs that can be represented by the intersection of unit intervals that may or may not contain their endpoints.
Shuchat, Alan   +3 more
core   +2 more sources

Laplacian matrices of weighted digraphs represented as quantum states

open access: yes, 2017
Representing graphs as quantum states is becoming an increasingly important approach to study entanglement of mixed states, alternate to the standard linear algebraic density matrix-based approach of study.
Adhikari, Bibhas   +3 more
core   +1 more source

Tau acetylation at K331 has limited impact on tau pathology in vivo

open access: yesFEBS Letters, EarlyView.
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto   +3 more
wiley   +1 more source

$\mathcal{B}$-Partitions, determinant and permanent of graphs [PDF]

open access: yesTransactions on Combinatorics, 2018
Let $G$ be a graph (directed or undirected) having $k$ number of blocks $B_1, B_2,\hdots,B_k$. A $\mathcal{B}$-partition of $G$ is a partition consists of $k$ vertex-disjoint subgraph $(\hat{B_1},\hat{B_1},\hdots,\hat{B_k})$ such that $\hat{B}_i$ is an ...
Ranveer Singh, Ravindra Bapat
doaj   +1 more source

Mixed Linear Layouts of Planar Graphs

open access: yes, 2017
A $k$-stack (respectively, $k$-queue) layout of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing (non-nested) edges with respect to the vertex ordering. In 1992, Heath and Rosenberg conjectured
C Bachmaier   +12 more
core   +1 more source

Mixing colourings in 2K2-free graphs

open access: yesDiscrete Mathematics, 2022
4 pages, 2 ...
Carl Feghali, Owen D. Merkel
openaire   +2 more sources

Home - About - Disclaimer - Privacy