On the largest matching roots of graphs with a given number of pendent vertices

In this note, we study the bounds of the largest matching roots of graphs with 0,1,2,3,4,n−2, and n−1 pendent vertices. We also determine the extremal graphs with respect to these bounds.

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 255; pp. 339 - 344
Main Authors Zhang, Hailiang, Chen, Guangting, Yu, Guanglong
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 28.02.2019
Elsevier BV
Subjects
Apexes
Extremal graph
Graph matching
Graphs
Largest matching root
Matching polynomial
Pendent vertex
Root matching
Roots
Pendent vertex
05C50
Matching polynomial
Extremal graph
Largest matching root
Online AccessGet full text

Cover

More Information
Summary:In this note, we study the bounds of the largest matching roots of graphs with 0,1,2,3,4,n−2, and n−1 pendent vertices. We also determine the extremal graphs with respect to these bounds.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2018.07.028