Results 41 to 50 of about 3,537,586 (309)

Hermitian Adjacency Matrix of Digraphs and Mixed Graphs [PDF]

Journal of Graph Theory, 2015
The article gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from x to y is equal to the complex unity i (and its ...
Krystal Guo, B. Mohar
semanticscholar   +1 more source

Completion of the mixed unit interval graphs hierarchy

, 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

Unifying Markov Properties for Graphical Models [PDF]

, 2017
Several types of graphs with different conditional independence interpretations --- also known as Markov properties --- have been proposed and used in graphical models.
Lauritzen, Steffen, Sadeghi, Kayvan
core   +3 more sources

The Index Weighted Hermitian Adjacency Matrices for Mixed Graphs

Utilitas mathematica
Based on the Hermitian adjacency matrices of second kind introduced by Mohar [1] and weighted adjacency matrices introduced in [2], we define a kind of index weighted Hermitian adjacency matrices of mixed graphs.
Zheng Wang, Tao She, Chunxian Wang
semanticscholar   +1 more source

On Mixed Metric Dimension of Rotationally Symmetric Graphs

IEEE Access, 2020
A vertex u ∈ V(G) resolves (distinguish or recognize) two elements (vertices or edges) v, w ∈ E(G)UV(G) if dG(u, v) ≠ dG(u, w) . A subset Lm of vertices in a connected graph G is called a mixed metric generator for G if every two ...
Hassan Raza, Jia-Bao Liu, Shaojian Qu
doaj   +1 more source

𝕮-inverse of graphs and mixed graphs

Open Mathematics
This article introduces a generalization of the concept of inverse graphs applicable to both graphs and mixed graphs. Given a graph GG with adjacency matrix A(G)A\left(G), the inverse graph G−1{G}^{-1} is defined such that its adjacency matrix is similar
Alomari Omar, Abudayah Mohammad, Ghanem Manal   +2 more
doaj   +1 more source

A Concise Study of Some Superhypergraph classes [PDF]

Neutrosophic Sets and Systems
In graph theory, the hypergraph extends the traditional graph structure by allowing edges to connect multiple vertices, and this concept is further broadened by the superhypergraph.
Florentin Smarandache, Takaaki Fujita
doaj   +1 more source

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

FEBS 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, Satoshi Hashimoto, Sota Ito, Chisato Kikuguchi, Miho Hoshi, Kiyoshi Yamaguchi, Yoichi Furukawa, Toru Suzuki, Toshifumi Inada   +8 more
wiley   +1 more source

PARP inhibitors elicit distinct transcriptional programs in homologous recombination competent castration‐resistant prostate cancer

Molecular Oncology, EarlyView.
PARP inhibitors are used to treat a small subset of prostate cancer patients. These studies reveal that PARP1 activity and expression are different between European American and African American prostate cancer tissue samples. Additionally, different PARP inhibitors cause unique and overlapping transcriptional changes, notably, p53 pathway upregulation.
Moriah L. Cunningham, Jasibel Vasquez‐Gonzalez, Samantha M. Barnada, Salome Tchotorlishvili, Latese Jones, Ryan Maguire, Genevieve Lewis, Kinza Rizwan, Jenny Deng, Salma Koachar, Drithi Patel, Hailey Shankle, Tessa Mulders, Namra Ajmal, Charalambos Solomides, Emad S. Alnemri, Teresa F. Alnemri, Ayesha A. Shafi, Leonard G. Gomella, Wm Kevin Kelly, Steven B. McMahon, Matthew J. Schiewer   +21 more
wiley   +1 more source

γ-Inverse graph of some mixed graphs

Special Matrices
Let GG be a graph. Then, the inverse graph G−1{G}^{-1} of GG is defined to be a graph that has adjacency matrix similar to the inverse of the adjacency matrix of GG, where the similarity matrix is ±1\pm 1 diagonal matrix. In this article, we introduced a
Boulahmar Wafa, Ghanem Manal, Abudayah Mohammad   +2 more
doaj   +1 more source