Results 41 to 50 of about 329,714 (296)
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
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
On the Powers of Signed Graphs [PDF]
, 2020 A signed graph is an ordered pair $ =(G, ),$ where $G=(V,E)$ is the underlying graph of $ $ with a signature function $ :E\rightarrow \{1,-1\}$. In this article, we define $n^{th}$ power of a signed graph and discuss some properties of these powers of signed graphs.
Germina K A, Shahul Hameed K, Shijin T V
openaire +2 more sources
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
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 balanced cycle domination of graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Let [Formula: see text] be a graph. A function [Formula: see text] is said to be a balanced cycle dominating function (BCDF) of [Formula: see text] if [Formula: see text] holds for any induced cycle [Formula: see text] of [Formula: see text] The balanced
Baogen Xu +3 more
doaj +1 more source
On Signed Graphs Whose Two Path Signed Graphs Are Switching Equivalent To Their Jump Signed Graphs [PDF]
, 2015 In this paper, we obtained a characterization of signed graphs whose jump signed graphs are switching equivalent to their two path signed graphs.
Kavita S Permi +2 more
openaire +1 more source
FEBS Letters, EarlyView.Spinal muscular atrophy (SMA) is a genetic disease affecting motor neurons. Individuals with SMA experience mitochondrial dysfunction and oxidative stress. The aim of the study was to investigate the effect of an antioxidant and neuroprotective substance, ergothioneine (ERGO), on an SMNΔ7 mouse model of SMA.
Francesca Cadile +8 more
wiley +1 more source
Discrete Applied Mathematics, 1980 AbstractA class of signed digraphs which arises naturally, in the theory of sign solvable linear systems is introduced. Several results are obtained concerning the structure of such graphs. Also an application is made revealing much of the structure of matrices of sign-solvable systems.
openaire +2 more sources
Discrete Applied Mathematics, 2002 A chordally signed graph is defined as a signed chordal graph (each edge is designated as being positive or negative and every induced cycle is a triangle) in which every cycle \(C\) containing an even number of negative edges (positive cycles) has a chord \(e\) such that \(C\cup\{e\}\) forms two positive cycles.
openaire +2 more sources