Results 41 to 50 of about 837,200 (246)
An algorithmic characterization and spectral analysis of canonical splitting signed graph ξ(Σ)
MethodsXAn ordered pair Σ=(Σu,σ) is called the signed graph, where Σu=(V,E) is an underlying graph and σ is a signed mapping, called signature, from E to the sign set {+,−}. A marking of Σ is a function μ:V(Σ)→{+,−}.
Deepa Sinha, Sandeep Kumar
doaj +1 more source
Signed Complete Graphs with Maximum Index
Discussiones Mathematicae Graph Theory, 2020 Let Γ = (G, σ) be a signed graph, where G is the underlying simple graph and σ E(G) → {−, +} is the sign function on the edges of G. The adjacency matrix of a signed graph has −1 or +1 for adjacent vertices, depending on the sign of the edges.
Akbari Saieed +3 more
doaj +1 more source
Notes on upper bounds for the largest eigenvalue based on edge-decompositions of a signed graph
Kuwait Journal of Science, 2023 The adjacency matrix of a signed graph has +1 or -1 for adjacent vertices, depending on the sign of the connecting edge. According to this concept, an ordinary graph can be interpreted as a signed graph without negative edges.
Zoran Stanić
doaj +1 more source
Ain Shams Engineering JournalThis paper presents an algorithm to compute the integrity of a signed fuzzy graph by systematically evaluating vertex subsets, removing them, and analyzing the resulting connected components.
Chakaravarthy Sankar +3 more
doaj +1 more source
Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A graph $G$ is signed if each edge is assigned $+$ or $-$. A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign $-$ if and only if its endpoints are in different parts.
Luerbio Faria +3 more
doaj +1 more source
Eigenspaces for \(-2\) in signed line graphs
The American Journal of CombinatoricsIt is known that \(-2\) appears in the spectrum of a connected signed line graph if and only if its root is either (a) a balanced signed graph, not a tree, that spans a switching of the complete signed graph or (b) an unbalanced simply signed graph ...
Zoran Stanić
doaj +1 more source
On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs
Discussiones Mathematicae Graph Theory, 2022 A signed graph has edge weights drawn from the set {+1, −1}, and is sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is sign-unbalanced.
Bašić Nino +3 more
doaj +1 more source
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
FEBS Letters, EarlyView.Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz +11 more
wiley +1 more source
Signed degree sets in signed graphs [PDF]
Czechoslovak Mathematical Journal, 2007 The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph.
Pirzada, S., Naikoo, T. A., Dar, F. A.
openaire +2 more sources
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source