Adjacency rank and independence number of a signed graph
From MaRDI portal
Publication:2302068
DOI10.1007/S40840-019-00811-YzbMath1433.05141OpenAlexW2963455681WikidataQ127458934 ScholiaQ127458934MaRDI QIDQ2302068
Publication date: 25 February 2020
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-019-00811-y
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)
Related Items (3)
Bounds for the rank of a complex unit gain graph in terms of the independence number ⋮ On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph ⋮ Bounds for the rank of a complex unit gain graph in terms of its maximum degree
Cites Work
- Unnamed Item
- Skew-adjacency matrices of graphs
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- Spektren endlicher Grafen
- The rank of a signed graph in terms of the rank of its underlying graph
- Further results on the nullity of signed graphs
- A note on the nullity of unicyclic signed graphs
- Skew-rank of an oriented graph and independence number of its underlying graph
- Signed graphs with small positive index of inertia
- On the Laplacian Eigenvalues of Signed Graphs
- Skew Spectrum of the Cartesian Product of an Oriented Graph with an Oriented Hypercube
- The skew-rank of oriented graphs
- The nullity of bicyclic signed graphs
- On the independence number of a graph in terms of order and size
- Skew-rank of an oriented graph in terms of matching number
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
This page was built for publication: Adjacency rank and independence number of a signed graph
