On the rank of weighted graphs
From MaRDI portal
Publication:2961497
DOI10.1080/03081087.2016.1201039zbMATH Open1356.05067OpenAlexW2461886709MaRDI QIDQ2961497FDOQ2961497
Authors:
Publication date: 20 February 2017
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2016.1201039
Recommendations
Cites Work
- Signed graphs
- Bounds for the least Laplacian eigenvalue of a signed graph
- On the notion of balance of a signed graph
- On the Laplacian Eigenvalues of Signed Graphs
- On the nullity of unicyclic graphs
- A characterization of graphs with rank 5
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
- A characterization of graphs with rank 4
- On the nullity of tricyclic graphs
- On the nullity of a graph with cut-points
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- On the nullity of graphs with pendant trees
- On the nullity of graphs with pendent vertices
- Positive and negative inertia index of a graph
- On the nullity of graphs
- Signed graphs, root lattices, and Coxeter groups
- Spectral criterion for cycle balance in networks
- The inertia of weighted unicyclic graphs
- A note on the nullity of unicyclic signed graphs
- The nullity of bicyclic signed graphs
- The extremal problems on the inertia of weighted bicyclic graphs
Cited In (12)
- Some criteria for a signed graph to have full rank
- The degree ratio ranking method for directed graphs
- The signed graphs with all but at most three eigenvalues equal to \(-1\)
- On graphs associated to sets of rankings
- On an ordering problem in weighted hypergraphs
- Behavior of the binary rank of a graph when vertices and edges are added
- Characterizations of signed graphs with small ranks
- On connected signed graphs with rank equal to girth
- On connected \(\mathbb{T}\)-gain graphs with rank equal to girth
- Ranking measures for radially Moore graphs
- On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs
- Edge ranking of graphs is hard
This page was built for publication: On the rank of weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961497)