Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
From MaRDI portal
(Redirected from Publication:4965923)
Recommendations
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- On the Hermitian-incidence energy of mixed graphs
- Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
Cites work
- 5-regular oriented graphs with optimum skew energy
- Anti-forcing spectra of perfect matchings of graphs
- Bicyclic digraphs with extremal skew energy
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- Bounds of graph energy in terms of vertex cover number
- Extremal cacti of given matching number with respect to the distance spectral radius
- First eigenvalue of nonsingular mixed unicyclic graphs with fixed number of branch vertices
- Graph energy change due to edge deletion
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- scientific article; zbMATH DE number 6113895 (Why is no real title available?)
- scientific article; zbMATH DE number 4214203 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Inequalities and equalities for the Cartesian decomposition of complex matrices
- Lower bounds of graph energy in terms of matching number
- Mixed graphs with \(H\)-rank 3
- Nordhaus-Gaddum type result for the matching number of a graph
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
- On energy of graphs
- On oriented graphs with minimal skew energy
- On the mixed adjacency matrix of a mixed graph
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- On the spectral radius of tricyclic graphs with a maximum matching
- On the spectral radius of weighted trees with given number of pendant vertices and a positive weight set
- Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
- Relation between the skew energy of an oriented graph and its matching number
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- Skew-rank of an oriented graph in terms of matching number
- Some new lower bounds for energy of graphs
- The energy of graphs and matrices
- The minimum matching energy of bicyclic graphs with given girth
- The skew energy of a digraph
- The spectral distribution of random mixed graphs
- The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
- Tricyclic oriented graphs with maximal skew energy
Cited in
(10)- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- Bounds for the energy of a complex unit gain graph
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- Hermite-ABC energy of mixed graphs
- On the Hermitian-incidence energy of mixed graphs
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
- 3-regular mixed graphs with optimum Hermitian energy
- Bounds and extremal graphs for the energy of complex unit gain graphs
This page was built for publication: Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965923)
