Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
DOI10.1080/03081087.2018.1543645zbMath1459.05194OpenAlexW2899681866WikidataQ114641344 ScholiaQ114641344MaRDI QIDQ4965923
Publication date: 18 March 2021
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2018.1543645
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum matching energy of bicyclic graphs with given girth
- On the spectral radius of tricyclic graphs with a maximum matching
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Bounds of graph energy in terms of vertex cover number
- Tricyclic oriented graphs with maximal skew energy
- Anti-forcing spectra of perfect matchings of graphs
- The spectral distribution of random mixed graphs
- First eigenvalue of nonsingular mixed unicyclic graphs with fixed number of branch vertices
- Mixed graphs with \(H\)-rank 3
- 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
- The energy of graphs and matrices
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
- Nordhaus-Gaddum type result for the matching number of a graph
- Extremal cacti of given matching number with respect to the distance spectral radius
- Some new lower bounds for energy of graphs
- 5-regular oriented graphs with optimum skew energy
- Lower bounds of graph energy in terms of matching number
- Relation between the skew energy of an oriented graph and its matching number
- The skew energy of a digraph
- Large regular bipartite graphs with median eigenvalue 1
- Graph energy change due to edge deletion
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the spectral radius of weighted trees with given number of pendant vertices and a positive weight set
- On oriented graphs with minimal skew energy
- Inequalities and equalities for the Cartesian decomposition of complex matrices
- On the mixed adjacency matrix of a mixed graph
- Skew-rank of an oriented graph in terms of matching number
This page was built for publication: Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
