On the tricyclic graphs with three disjoint 6-cycles and maximum matching energy

DOI10.5556/J.TKJM.46.2015.1768zbMATH Open1331.05149OpenAlexW2198553968MaRDI QIDQ5744571FDOQ5744571

Authors: Yunxia Zhou, Honghai Li 

Publication date: 18 February 2016

Published in: Tamkang Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5556/j.tkjm.46.2015.1768

Recommendations

• Maximal matching energy of tricyclic graphs
• Minimum matching energy of tricyclic graphs
• The minimum matching energy of tricyclic graphs with given girth and without \(K_4\)-subdivision.
• Bounds on the matching energy of unicyclic odd-cycle graphs
• The maximum matching energy of bicyclic graphs with even girth

zbMATH Keywords

matching polynomialmatching energytricyclic graph\(k\)-matching

Mathematics Subject Classification ID

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

Cited In (2)

• The tight upper bound for the number of matchings of tricyclic graphs
• On the index of tricyclic graphs with perfect matchings

This page was built for publication: On the tricyclic graphs with three disjoint 6-cycles and maximum matching energy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5744571)