The minimum matching energy of tricyclic graphs with given girth and without K₄-subdivision.

zbMATH Open1424.05189MaRDI QIDQ4598984FDOQ4598984

Authors: Gang Ma, Shengjin Ji, Qiuju Bian, Xia Li 

Publication date: 15 December 2017

Recommendations

• Minimum matching energy of tricyclic graphs
• The minimum matching energy of bicyclic graphs with given girth
• On the tricyclic graphs with three disjoint 6-cycles and maximum matching energy
• The maximum matching energy of bicyclic graphs with even girth
• Maximal matching energy of tricyclic graphs

zbMATH Keywords

girthmatching energytricyclic graphgraph energy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31)

Cited In (6)

• The minimum matching energy of bicyclic graphs with given girth
• Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
• Maximal matching energy of tricyclic graphs
• On the tricyclic graphs with three disjoint 6-cycles and maximum matching energy
• Minimum matching energy of tricyclic graphs
• Extremal values of matching energies of one class of graphs

This page was built for publication: The minimum matching energy of tricyclic graphs with given girth and without \(K_4\)-subdivision.

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