The minimum matching energy of bicyclic graphs with given girth
From MaRDI portal
(Redirected from Publication:329923)
Recommendations
- The minimum matching energy of tricyclic graphs with given girth and without \(K_4\)-subdivision.
- The maximum matching energy of bicyclic graphs with even girth
- The minimal matching energy of unicyclic graphs of a given diameter
- On minimal matching energy of unicyclic graphs with prescribed girth and pendent vertices
- Ordering of bicyclic graphs by matching energy
Cites work
- scientific article; zbMATH DE number 3679880 (Why is no real title available?)
- scientific article; zbMATH DE number 3893246 (Why is no real title available?)
- Extremal graph with respect to matching energy for a random polyphenyl chain
- Extremal matching energy of bicyclic graphs
- Graphs with extremal matching energies and prescribed parameters
- Maximal matching energy of tricyclic graphs
- On a conjecture about tricyclic graphs with maximal energy
- On the Merrifield-Simmons index and Hosoya index of bicyclic graphs with a given girth.
- On the ordering of graphs with respect to their matching numbers
- On the signless Laplacian coefficients of unicyclic graphs
- Recent results in the theory of graph spectra
- The extremal matching energy of graphs.
- The matching energy of a graph
- The matching energy of graphs with given edge connectivity
- The matching energy of graphs with given parameters
- The minimal matching energy of \((n,m)\)-graphs with a given matching number
- The smallest hosoya index in \((n,n+1)\)-graphs
Cited in
(12)- On minimum matching energy of graphs
- The minimum matching energy of tricyclic graphs with given girth and without \(K_4\)-subdivision.
- The maximum matching energy of bicyclic graphs with even girth
- Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
- On the minimal matching energies of unicyclic graphs
- Minimum matching energy of tricyclic graphs
- scientific article; zbMATH DE number 6746235 (Why is no real title available?)
- Ordering of bicyclic graphs by matching energy
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- Bicyclic graphs with minimum energy
- Extremal bipartite graphs of given connectivity with respect to matching energy
- On minimal matching energy of unicyclic graphs with prescribed girth and pendent vertices
This page was built for publication: The minimum matching energy of bicyclic graphs with given girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329923)