The minimum matching energy of bicyclic graphs with given girth

DOI10.1216/RMJ-2016-46-4-1275zbMATH Open1347.05116MaRDI QIDQ329923FDOQ329923

Authors: L. Zou, Honghai Li 

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

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

zbMATH Keywords

girthbicyclic graphmatching energy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Maximal Matching Energy of Tricyclic Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The matching energy of graphs with given edge connectivity
• The matching energy of a graph
• The matching energy of graphs with given parameters
• On the ordering of graphs with respect to their matching numbers
• On the Merrifield-Simmons index and Hosoya index of bicyclic graphs with a given girth.
• The matching energy of graphs with given edge connectivity
• The smallest hosoya index in \((n,n+1)\)-graphs

Cited In (7)

• The maximum matching energy of bicyclic graphs with even girth
• Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
• Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
• Bicyclic graphs with minimum energy
• Title not available (Why is that?)
• Extremal bipartite graphs of given connectivity with respect to matching energy
• On the minimal matching energies of unicyclic graphs

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)