Contents

Ars Combinatoria

  • Research article

The Minimum Matching Energy of Tricyclic Graphs with Given Girth and without \(K_4\)-Subdivision

Gang Ma1, Shengjin Ji1,2, Qiuju Bian1, Xia Li1
1School of Science, Shandong University of Technology, Zibo, Shandong, China
2School of Mathematics, Shandong University, Jinan, Shandong, China
  • Published: 30/04/2017

Abstract

The matching energy of a graph was introduced by Gutman and Wagner in \(2012\) and defined as the sum of the absolute values of zeros of its matching polynomial. In this paper, we completely determine the graph with minimum matching energy in tricyclic graphs with given girth and without \(K_4\)-subdivision.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Gang Ma, Shengjin Ji, Qiuju Bian, Xia Li. The Minimum Matching Energy of Tricyclic Graphs with Given Girth and without \(K_4\)-Subdivision[J], Ars Combinatoria, Volume 132. 403-419. .