The Ordering of the Unicyclic Graphs with respect to Largest Matching Root with Given Matching Number

Luozhong Gong, Weijun Liu and Musavarah Sarwar

Journal of Mathematics, 2022, vol. 2022, 1-8

Abstract: The matching roots of a simple connected graph G are the roots of the matching polynomial which is defined as MGx=∑k=0n/2−1kmG,kxn−2k, where mG,k is the number of the k matchings of G. Let λ1G denote the largest matching root of the graph G. In this paper, among the unicyclic graphs of order n, we present the ordering of the unicyclic graphs with matching number 2 according to the λ1G values for n≥11 and also determine the graphs with the first and second largest λ1G values with matching number 3.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/3589448.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/3589448.xml (application/xml)

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:hin:jjmath:3589448

DOI: 10.1155/2022/3589448

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().