The nullity of bicyclic signed graphs
From MaRDI portal
Abstract: Let Gamma be a signed graph and let A(Gamma) be the adjacency matrix of Gamma. The nullity of Gamma is the multiplicity of eigenvalue zero in the spectrum of A(Gamma). In this paper we characterize the signed graphs of order n with nullity n-2 or n-3, and introduce a graph transformation which preserves the nullity. As an application we determine the unbalanced bicyclic signed graphs of order n with nullity n-3 or n-4, and signed bicyclic signed graphs (including simple bicyclic graphs) of order n with nullity n-5.
Recommendations
Cites work
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- A note on the nullity of unicyclic signed graphs
- Largest eigenvalue of a unicyclic mixed graphs
- On the Laplacian Eigenvalues of Signed Graphs
- On the null-spaces of acyclic and unicyclic singular graphs
- On the nullity and the matching number of unicyclic graphs
- On the nullity of a graph with cut-points
- On the nullity of bicyclic graphs
- On the nullity of bipartite graphs
- On the nullity of graphs
- On the nullity of graphs with pendant trees
- On the nullity of graphs with pendent vertices
- On the nullity of line graphs of trees
- On the nullity of unicyclic graphs
- Spektren endlicher Grafen
- The minimum rank of symmetric matrices described by a graph: a survey
- Trees with maximum nullity
Cited in
(33)- The rank of a signed graph in terms of the rank of its underlying graph
- Signed graphs with cut points whose positive inertia indexes are two
- Further results on the nullity of signed graphs
- More on spectral analysis of signed networks
- A note on the nullity of unicyclic signed graphs
- Spectra of signed graphs
- On connected signed graphs with rank equal to girth
- The rank of a signed graph
- Some criteria for a signed graph to have full rank
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
- On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs
- Two-connected signed graphs with maximum nullity at most two
- No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
- Adjacency rank and independence number of a signed graph
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- The inertia of weighted unicyclic graphs
- On the nullity of a family of tripartite graphs
- Signed graphs with small positive index of inertia
- On the rank of weighted graphs
- A characterization of bicyclic signed graphs with nullity n-7
- scientific article; zbMATH DE number 5642062 (Why is no real title available?)
- Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
- The dimension of the negative cycle vectors of a signed graph
- On signed digraphs with all cycles negative
- The nullities of signed cycle-spliced graphs
- Signed graphs with maximum nullity two
- On connected \(\mathbb{T}\)-gain graphs with rank equal to girth
- Singularity of cycle-spliced signed graphs
- A bound on the rank of weighted graphs in terms of girth
- Signed graphs G^ with nullity n(G^) - g(G^) -1
- On the nullity of cycle-spliced \(\mathbb{T}\)-gain graphs
- Relation between the rank of a signed graph and the fractional matching number of its underlying graph
- Signed graphs whose signed Colin de Verdière parameter is two
This page was built for publication: The nullity of bicyclic signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5409957)
