Results 61 to 70 of about 837,200 (246)

On colorings and orientations of signed graphs [PDF]

open access: yesDiscrete Mathematics Letters, 2023
Daniel Slilaty
doaj   +1 more source

Computation of the eigenvalues of complete signed graphs

open access: yesElectronic Journal of Graph Theory and Applications
A signed graph Σ is the ordered pair (G,σ), where G=(V,E) is a finite simple graph, called the underlying graph, and σ: E(G) → {+1, -1} is a sign function or a signature of Σ. Let (K_n,σ) be a complete signed graph with n vertices. In this paper, we give
Shariefuddin Pirzada   +3 more
doaj   +1 more source

Translophagy—A potential link between autophagy impairment and translational errors

open access: yesFEBS Letters, EarlyView.
Neurodegenerative diseases are characterised by the accumulation of abnormal proteins and protein aggregates, but their origin often remains unknown. We propose that selective autophagy removes damaged protein‐making machinery, preventing errors during protein synthesis.
Mykola V. Korolchuk   +11 more
wiley   +1 more source

On the signed Italian domination of graphs [PDF]

open access: yesComputer Science Journal of Moldova, 2019
A signed Italian dominating function on a graph $G=(V,E)$ is a function $f:V\to \{ -1, 1, 2 \}$ satisfying the condition that for every vertex $u$, $f[u]\ge 1$. The weight of signed Italian dominating function is the value $f(V)=\sum_{u\in V}f(u)$.
Ashraf Karamzadeh   +2 more
doaj  

Circular RNA expression landscapes in myelodysplastic neoplasms: Associations with mutational signatures and disease progression

open access: yesMolecular Oncology, EarlyView.
In this explorative study, the abundance of circular RNA molecules in bone marrow stem cells was found to be elevated in patients with high‐risk myelodysplastic neoplasms, and to be associated with an increased risk of progression to acute myeloid leukemia.
Eileen Wedge   +17 more
wiley   +1 more source

Bipartite Consensus Problems on Second-Order Signed Networks With Heterogeneous Topologies

open access: yesIEEE Access, 2020
This paper is devoted to the convergence problem for second-order signed networks that are associated with two signed graphs in the presence of heterogeneous topologies.
Jianheng Ling   +2 more
doaj   +1 more source

Signed Laplacian Graph Neural Networks

open access: yes, 2023
This paper studies learning meaningful node representations for signed graphs, where both positive and negative links exist. This problem has been widely studied by meticulously designing expressive signed graph neural networks, as well as capturing the ...
Li, Yu, Tang, Jian, Qu, Meng, Chang, Yi
core   +1 more source

Differential expression of cancer‐related genes supports prediction of poor response to first‐line treatments in T‐ALL pediatric patients with high minimal residual disease

open access: yesMolecular Oncology, EarlyView.
In the present work, we have identified a transcriptional signature based on the differential expression of six genes (BCL2&MAST4, HSH2D&LAT2, METRN&PITPNM2) that would facilitate the early detection of T‐cell acute lymphoblastic leukemia (T‐ALL) patients prone to a poor treatment response and could be implemented at diagnosis, along with other risk ...
Antonio Lahera   +11 more
wiley   +1 more source

The common minimal common neighborhood dominating signed graphs [PDF]

open access: yesTransactions on Combinatorics, 2013
In this paper, we define the common minimal common neighborhooddominating signed graph (or common minimal $CN$-dominating signedgraph) of a given signed graph and offer a structuralcharacterization of common minimal $CN$-dominating signed graphs.In the ...
Kavita S Permi   +2 more
doaj  

Degree of an edge and Platt Number in signed networks

open access: yesRatio Mathematica, 2023
Positive labelled edges play a vital role in network analysis.The degree of edges in signed graphs is introduced by giving importance to positive edges incident on the end vertices of that edge. The concept of Platt number of a graph, which is the sum of
Diviya K D, Anjaly Kishore
doaj   +1 more source

Home - About - Disclaimer - Privacy