On the multiplicity of α as an eigenvalue of the Aα matrix of a graph in terms of the number of pendant vertices

Let G=(V(G),E(G)) be a simple undirected graph with vertex set V(G) and edge set E(G). The cyclomatic number of a connected graph G is defined as θ(G)=|E(G)|−|V(G)|+1. The Aα matrix of a graph G is defined by Nikiforov as Aα(G)=αD(G)+(1−α)A(G), where α∈[0,1], A(G) and D(G) respectively denotes the a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Linear algebra and its applications 2020-06, Vol.594, p.193-204
Hauptverfasser:	Xu, Feng, Wong, Dein, Tian, Fenglei
Format:	Artikel
Sprache:	eng
Schlagworte:	[formula omitted]-eigenvalues Apexes Closures Clusters Eigenvalues Graph theory Graphs Linear algebra Lower bounds Multiplicity of an eigenvalue Signless Laplacian matrix Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!