Results 11 to 20 of about 34,873 (209)
Interleaving Automatic Segmentation and Expert Opinion for Retinal Conditions
Optical coherence tomography (OCT) has become the leading diagnostic tool in modern ophthalmology. We are interested here in developing a support tool for the segmentation of retina layers. The proposed method relies on graph theory and geodesic distance.
Sergiu Bilc +3 more
doaj +1 more source
When nuclear power plants (NPPs) are in a state of failure, they may release radioactive material into the environment. The safety of NPPs must thus be maintained at a high standard. Online monitoring and fault detection and diagnosis (FDD) are important
Wu Guohua +5 more
doaj +1 more source
Signed graphs connected with the root lattice
For any base of the root lattice (An) we can construct a signed graph. A signed graph is one whose edges are signed by +1 or -1. A signed graph is balanced if and only if its vertex set can be divided into two sets-either of which may be empty–so that ...
RN Yadav
doaj +3 more sources
On Regular Signed Graphs with Three Eigenvalues
In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establish certain basic results; for example, we show that they are walk-regular.
Anđelić Milica +2 more
doaj +1 more source
The H-Line Signed Graph Of A Signed Graph
For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required. We treat only finite simple graphs without self loops and isolates.
Rangarajan, R. +2 more
openaire +3 more sources
On products and line graphs of signed graphs, their eigenvalues and energy
In this article we examine the adjacency and Laplacian matrices and their eigenvalues and energies of the general product (non-complete extended $p$-sum, or NEPS) of signed graphs. We express the adjacency matrix of the product in terms of the Kronecker matrix product and the eigenvalues and energy of the product in terms of those of the factor signed ...
Germina, K.A. +2 more
openaire +2 more sources
On $bullet$-lict signed graphs $L_{bullet_c}(S)$ and $bullet$-line signed graphs $L_bullet(S)$ [PDF]
A emph{signed graph} (or, in short, emph{sigraph}) $S=(S^u,sigma)$ consists of an underlying graph $S^u :=G=(V,E)$ and a function $sigma:E(S^u)longrightarrow {+,-}$, called the signature of $S$. A emph{marking} of $S$ is a function $mu:V(S)longrightarrow
Mukti Acharya +2 more
doaj
Line and Subdivision Graphs Determined by
Let T 4 = { ± 1 , ± i } be the subgroup of fourth roots of unity inside T , the multiplicative group of complex units. For a T 4 -gain graph Φ = ( Γ , T 4 , φ ) , we introduce gain functions on ...
Abdullah Alazemi +4 more
doaj +1 more source
A signed graph (marked graph) is an ordered pair $S=(G,sigma)$ $(S=(G,mu))$, where $G=(V,E)$ is a graph called the underlying graph of $S$ and $sigma:Erightarrow{+,-}$ $(mu:Vrightarrow{+,-})$ is a function.
Kishori P. Narayankar
doaj
We identified a systemic, progressive loss of protein S‐glutathionylation—detected by nonreducing western blotting—alongside dysregulation of glutathione‐cycle enzymes in both neuronal and peripheral tissues of Taiwanese SMA mice. These alterations were partially rescued by SMN antisense oligonucleotide therapy, revealing persistent redox imbalance as ...
Sofia Vrettou, Brunhilde Wirth
wiley +1 more source

