On the Aα-spectral Radius of Graphs Without Large Matchings

Let G be an n -vertex graph. A matching in G is a set of independent edges, i.e., no two edges in the set are adjacent in G . The matching number is the maximal size of a matching in G . Nikiforov (Appl Anal Discrete Math 11(1):81–107, 2017) proposed the A α -matrix of a graph G , as follows: A α (...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Bulletin of the Malaysian Mathematical Sciences Society 2022-11, Vol.45 (6), p.3131-3156
Hauptverfasser:	Hao, Yifang, Li, Shuchao, Zhao, Qin
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications of Mathematics Eigenvectors Graph matching Graph theory Mathematics Mathematics and Statistics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!