Relation between the skew energy of an oriented graph and its matching number
From MaRDI portal
(Redirected from Publication:1786884)
Recommendations
- scientific article; zbMATH DE number 6795197
- Skew-rank of an oriented graph in terms of matching number
- Note on the skew energy of oriented graphs
- Skew Randić energy of an oriented graph
- Upper bound of skew energy of an oriented graph in terms of its skew rank
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Minimal skew energy of oriented unicyclic graphs with a perfect matching
- On oriented graphs with minimal skew energy
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- The skew energy of random oriented graphs
Cites work
- 3-regular digraphs with optimum skew energy
- 4-regular oriented graphs with optimum skew energies
- 4-regular oriented graphs with optimum skew energy
- Bicyclic digraphs with extremal skew energy
- Bicyclic oriented graphs with the second largest skew-energy
- Graph energy change due to edge deletion
- Lower bounds of the skew spectral radii and skew energy of oriented graphs
- Minimal skew energy of oriented unicyclic graphs with fixed diameter
- On oriented graphs with minimal skew energy
- On the skew spectra of Cartesian products of graphs
- Oriented unicyclic graphs with the first \(\lfloor\frac {n-9}{2}\rfloor\) largest skew energies
- Skew spectra of oriented bipartite graphs
- Skew-adjacency matrices of graphs
- Skew-rank of an oriented graph in terms of matching number
- Skew-spectra and skew energy of various products of graphs
- Some relations between rank, chromatic number and energy of graphs
- The skew energy of a digraph
Cited in
(10)- Energy, matching number and odd cycles of graphs
- Bounds for the energy of a complex unit gain graph
- Extremal Laplacian energy of directed trees, unicyclic digraphs and bicyclic digraphs
- Upper bound of skew energy of an oriented graph in terms of its skew rank
- Spectral norm of oriented graphs
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- Upper bounds of the energy of triangle-free graphs in terms of matching number
- scientific article; zbMATH DE number 6746235 (Why is no real title available?)
- scientific article; zbMATH DE number 6795197 (Why is no real title available?)
This page was built for publication: Relation between the skew energy of an oriented graph and its matching number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786884)