2013
DOI: 10.1016/j.laa.2013.04.032
|View full text |Cite
|
Sign up to set email alerts
|

The inertia set of a signed graph

Abstract: A signed graph is a pair (G, Σ), where G = (V, E) is a graph (in which parallel edges are permitted, but loops are not) with V = {1, . . . , n} and Σ ⊆ E. By S(G, Σ) we denote the set of all symmetric V × V matrices A = [ai,j] with ai,j < 0 if i and j are connected by only even edges, ai,j > 0 if i and j are connected by only odd edges, ai,j ∈ R if i and j are connected by both even and odd edges, ai,j = 0 if i = j and i and j are non-adjacent, and ai,i ∈ R for all vertices i. The stable inertia set of a signe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 14 publications
(20 citation statements)
references
References 16 publications
0
20
0
Order By: Relevance
“…In [1] we also proved that a signed graph (G, Σ) has ν(G, Σ) ≤ 1 if and only if (G, Σ) is bipartite. For a positive integer n, we denote by K o n the signed graph (K n , E(K n )) and by K = n the signed graph (G, E(K n )), where G is the graph obtained from K n by adding to each edge an edge in parallel.…”
Section: Introductionmentioning
confidence: 85%
See 3 more Smart Citations
“…In [1] we also proved that a signed graph (G, Σ) has ν(G, Σ) ≤ 1 if and only if (G, Σ) is bipartite. For a positive integer n, we denote by K o n the signed graph (K n , E(K n )) and by K = n the signed graph (G, E(K n )), where G is the graph obtained from K n by adding to each edge an edge in parallel.…”
Section: Introductionmentioning
confidence: 85%
“…Then we obtain formulas which allow to calculate ν(G, Σ) from the values of ν on the parts of a 0-, 1-, 2-, or 3-split of (G, Σ). A proof of the following lemma can be found in [1].…”
Section: Splits Reductions and ∆Y -Exchanges In Signed Graphsmentioning
confidence: 99%
See 2 more Smart Citations
“…Remark 2.7. With and without the restriction of having the SAP, the inertia sets that can be achieved by matrices in S(G) are considered in the literature (e.g., see [1,6]). With the help of Theorem 2.6, if Z SAP (G) = 0, then these two inertia sets are the same.…”
Section: Sap Zero Forcing Parametersmentioning
confidence: 99%