On the spectral moment of quasi-bicyclic graphs

Longfei Fang, Bing Wang and Mingqing Zhai

Applied Mathematics and Computation, 2019, vol. 363, issue C, -

Abstract: Let G be a connected graph. If G contains a vertex v such that G−v is a bicyclic graph, then G is called a quasi-bicyclic graph. Let Bn,d¯={G : G is a quasi-bicyclic graph of order n with G−u¯ being bicyclic and dG(u¯)=d¯}. We study structure characteristics of graphs on spectral moments. We also determine the last and the second last quasi-bicyclic graphs, in S-order, among all graphs in Bn,d¯, respectively.

Keywords: Quasi-bicyclic graph; Spectral moments; S-order (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319305934
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:363:y:2019:i:c:7

DOI: 10.1016/j.amc.2019.124601

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().