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

数学与统计学院

Northwestern Polytechnical University Xian

科研成果: 期刊稿件 › 文章 › 同行评审

9 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	341-365
页数	25
期刊	Match
卷	79
期	2
出版状态	已出版 - 2018

其它文件与链接

链接到 Scopus 的出版物

引用此

@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 - https://www.scopus.com/pages/publications/85040951036

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

摘要

其它文件与链接

指纹

引用此