Ordering of bicyclic graphs by matching energy

Xiangxiang Liu; Ligong Wang; Peng Xiao

Ordering of bicyclic graphs by matching energy

Xiangxiang Liu, Ligong Wang, Peng Xiao

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

Let G be a simple graph of order n and μ₁, μ₂, ⋯, μ_n be the roots of its matching polynomial. The matching energy is defined as the sum Σⁿ_i=1 /μ_i/, which was introduced by Gutman and Wagner in 2012. For bicyclic graphs of order n, the graphs with the first five smallest matching energies are determined and the graph with the second greatest matching energy is also determined in this paper.

Original language	English
Pages (from-to)	341-365
Number of pages	25
Journal	Match
Volume	79
Issue number	2
State	Published - 2018

Cite this

@article{e155d3f960774d67a8209adfcfab78d4,

title = "Ordering of bicyclic graphs by matching energy",

abstract = "Let G be a simple graph of order n and μ1, μ2, ⋯, μn be the roots of its matching polynomial. The matching energy is defined as the sum Σni=1 /μi/, which was introduced by Gutman and Wagner in 2012. For bicyclic graphs of order n, the graphs with the first five smallest matching energies are determined and the graph with the second greatest matching energy is also determined in this paper.",

author = "Xiangxiang Liu and Ligong Wang and Peng Xiao",

year = "2018",

language = "英语",

volume = "79",

pages = "341--365",

journal = "Match",

issn = "0340-6253",

publisher = "University of Kragujevac, Faculty of Science",

number = "2",

}

TY - JOUR

T1 - Ordering of bicyclic graphs by matching energy

AU - Liu, Xiangxiang

AU - Wang, Ligong

AU - Xiao, Peng

PY - 2018

Y1 - 2018

N2 - Let G be a simple graph of order n and μ1, μ2, ⋯, μn be the roots of its matching polynomial. The matching energy is defined as the sum Σni=1 /μi/, which was introduced by Gutman and Wagner in 2012. For bicyclic graphs of order n, the graphs with the first five smallest matching energies are determined and the graph with the second greatest matching energy is also determined in this paper.

AB - Let G be a simple graph of order n and μ1, μ2, ⋯, μn be the roots of its matching polynomial. The matching energy is defined as the sum Σni=1 /μi/, which was introduced by Gutman and Wagner in 2012. For bicyclic graphs of order n, the graphs with the first five smallest matching energies are determined and the graph with the second greatest matching energy is also determined in this paper.

UR - http://www.scopus.com/inward/record.url?scp=85040951036&partnerID=8YFLogxK

M3 - 文章

AN - SCOPUS:85040951036

SN - 0340-6253

VL - 79

SP - 341

EP - 365

JO - Match

JF - Match

IS - 2

ER -

Ordering of bicyclic graphs by matching energy

Abstract

Other files and links

Fingerprint

Cite this