Minimum matching energy of tricyclic graphs

DOI10.3969/J.ISSN.1006-6330.2018.04.016MaRDI QIDQ5195367zbMATH OpenFDO

Authors Wen-Huan Wang, Lei Zhong

Publication date 2 October 2019

Full work available at URL https://doi.org/10.3969/J.ISSN.1006-6330.2018.04.016

zbMATH Keywords

matchingmatching energytricyclic graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The minimum matching energy of tricyclic graphs with given girth and without K₄-subdivision.
• Extremal matching energy of bicyclic graphs
• On the tricyclic graphs with three disjoint 6-cycles and maximum matching energy
• Maximal matching energy of tricyclic graphs
• The minimum matching energy of bicyclic graphs with given girth

Cited in

(12)

• Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
• Sharp lower bound for the total number of matchings of tricyclic graphs
• On the Laplacian coefficients of tricyclic graphs with prescribed matching number
• The minimal matching energy of unicyclic graphs of a given diameter
• scientific article; zbMATH DE number 5627532 (Why is no real title available?)
• The minimum matching energy of tricyclic graphs with given girth and without K₄-subdivision.
• The minimal matching energy of (n,m)-graphs with a given matching number
• Maximal matching energy of tricyclic graphs
• On minimum matching energy of graphs
• scientific article; zbMATH DE number 5259335 (Why is no real title available?)
• On the tricyclic graphs with three disjoint 6-cycles and maximum matching energy
• Extremal values of matching energies of one class of graphs

This page was built for publication: Minimum matching energy of tricyclic graphs

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