Bicyclic oriented graphs with skew-rank 2 or 4
From MaRDI portal
Publication:300178
DOI10.1016/J.AMC.2015.02.014zbMATH Open1338.05103OpenAlexW1988161022MaRDI QIDQ300178FDOQ300178
Publication date: 23 June 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.02.014
Recommendations
Cites Work
- Graph energy
- Hypoenergetic trees
- The skew energy of a digraph
- Skew spectra of oriented graphs
- Some inequalities on the skew-spectral radii of oriented graphs
- Skew-adjacency matrices of graphs
- Characteristic polynomials of skew-adjacency matrices of oriented graphs
- 3-regular digraphs with optimum skew energy
- On the minimal energy of trees with a given number of vertices of odd degree
- On the nullity of bicyclic graphs
- On a conjecture about tricyclic graphs with maximal energy
- The minimal matching energy of \((n,m)\)-graphs with a given matching number
- Maximal matching energy of tricyclic graphs
- Extremal graph with respect to matching energy for a random polyphenyl chain
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- Oriented unicyclic graphs with the first \(\lfloor\frac {n-9}{2}\rfloor\) largest skew energies
- On the skew spectra of Cartesian products of graphs
- 4-regular oriented graphs with optimum skew energy
- Skew spectra of oriented bipartite graphs
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- Complete solution to a conjecture on the fourth maximal energy tree
- Skew spectrum of the Cartesian product of an oriented graph with an oriented hypercube
- The skew-rank of oriented graphs
- On the skew energy of orientations of hypercubes
- Complete solution to a problem on the maximal energy of unicyclic bipartite graphs
Cited In (19)
- A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
- Rank reduction of oriented graphs by vertex and edge deletions
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Skew-rank of an oriented graph in terms of matching number
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- Complex unit gain graphs of rank 2
- Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
- Complex unit gain bicyclic graphs with rank 2, 3 or 4
- The rank of a complex unit gain graph in terms of the rank of its underlying graph
- The rank of a signed graph in terms of the rank of its underlying graph
- Upper bound of skew energy of an oriented graph in terms of its skew rank
- The skew-rank of some oriented graphs
- Bicyclic oriented graphs with skew-rank 6
- Classes of graphs with minimum skew rank 4
- Skew-rank of an oriented graph with edge-disjoint cycles
- Bounds on the nullity, the \(H\)-rank and the Hermitian energy of a mixed graph
This page was built for publication: Bicyclic oriented graphs with skew-rank 2 or 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300178)