Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
From MaRDI portal
Publication:1627605
DOI10.1216/RMJ-2018-48-6-1983zbMath1440.05143WikidataQ128901493 ScholiaQ128901493MaRDI QIDQ1627605
Publication date: 30 November 2018
Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.rmjm/1543028449
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)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximum matching energy of bicyclic graphs with even girth
- The minimum matching energy of bicyclic graphs with given girth
- The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
- The matching energy of a graph
- The matching energy of graphs with given parameters
- The matching energy of graphs with given edge connectivity
- An introduction to matching polynomials
- The matching energy of random graphs
- Graph Energy
- The Maximal Matching Energy of Tricyclic Graphs
- The matching energy of graphs with given edge connectivity
This page was built for publication: Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth