The minimum matching energy of bicyclic graphs with given girth
From MaRDI portal
Publication:329923
DOI10.1216/RMJ-2016-46-4-1275zbMath1347.05116MaRDI QIDQ329923
Publication date: 24 October 2016
Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.rmjm/1476884583
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)
Related Items (5)
The maximum matching energy of bicyclic graphs with even girth ⋮ Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth ⋮ Extremal bipartite graphs of given connectivity with respect to matching energy ⋮ On the minimal matching energies of unicyclic graphs ⋮ Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The matching energy of a graph
- The matching energy of graphs with given parameters
- The matching energy of graphs with given edge connectivity
- The smallest hosoya index in \((n,n+1)\)-graphs
- On the ordering of graphs with respect to their matching numbers
- Recent results in the theory of graph spectra
- On the signless Laplacian coefficients of unicyclic graphs
- On a conjecture about tricyclic graphs with maximal energy
- The Maximal Matching Energy of Tricyclic Graphs
- The matching energy of graphs with given edge connectivity
This page was built for publication: The minimum matching energy of bicyclic graphs with given girth