scientific article; zbMATH DE number 7410909
From MaRDI portal
Publication:5157523
Recommendations
- Extremal bipartite graphs of given connectivity with respect to matching energy
- Extremal matching energy of bicyclic graphs
- Graphs with extremal matching energies and prescribed parameters
- Extremal matching energy and the largest matching root of complete multipartite graphs
- Extremal values of matching energies of one class of graphs
- scientific article; zbMATH DE number 5926313
- Upper bounds on the energy of graphs in terms of matching number
- The maximum matching energy of bicyclic graphs with even girth
- The matching energy of graphs with given parameters
- On bipartite graphs with minimal energy
Cited in
(12)- Extremal bipartite graphs of given connectivity with respect to matching energy
- Matchings in graphs with a given number of cuts
- Extremal matching energy and the largest matching root of complete multipartite graphs
- scientific article; zbMATH DE number 1323481 (Why is no real title available?)
- Bounds for the spectral radius and energy of extended adjacency matrix of graphs
- Ordering of bicyclic graphs by matching energy
- The minimal matching energy of (n,m)-graphs with a given matching number
- Extremal matching energy of bicyclic graphs
- The extremal matching energy of graphs.
- Matchings in bipartite graphs with a given number of cuts
- The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
- The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157523)
