Minimum matching energy of tricyclic graphs

DOI10.3969/J.ISSN.1006-6330.2018.04.016zbMATH Open1438.05202MaRDI QIDQ5195367FDOQ5195367

Authors: Wen-Huan Wang, Lei Zhong 

Publication date: 2 October 2019

Recommendations

• The minimum matching energy of tricyclic graphs with given girth and without \(K_4\)-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

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)

Cited In (12)

• The minimal matching energy of unicyclic graphs of a given diameter
• Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
• Title not available (Why is that?)
• The minimum matching energy of tricyclic graphs with given girth and without \(K_4\)-subdivision.
• Title not available (Why is that?)
• On the Laplacian coefficients of tricyclic graphs with prescribed matching number
• Maximal matching energy of tricyclic graphs
• The minimal matching energy of \((n,m)\)-graphs with a given matching number
• On minimum matching energy of graphs
• Sharp lower bound for the total number of matchings of tricyclic graphs
• 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)