The maximum A_-spectral radius of t-connected graphs with bounded matching number

DOI10.1016/J.DISC.2023.113447zbMATH Open1514.05100arXiv2203.13415MaRDI QIDQ6041869FDOQ6041869

Authors: Chang Liu, Zimo Yan, Jianping Li 

Publication date: 15 May 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be a diagonal matrix of the degrees of $G$. In 2017, Nikiforov defined the $A_{alpha}$-matrix of $G$ as �egin{equation*} A_{alpha}(G)=alpha G)+(1-alpha)A(G), end{equation*}d where $alphain[0,1]$ is an arbitrary real number. The largest eigenvalue of $A_{alpha}(G)$ is called the $A_{alpha}$-spectral radius of $G$. Let $n$, $t$, $k$ be positive integers, satisfying $tgeq1$, $kgeq2$, $ngeqk+2$, and $nequivk$ (mod $2$). In this paper, for $alphain[0,frac12]$, we determine the extremal graphs with the maximum $A_{alpha}$-spectral radius among all $t$-connected graphs on $n$ vertices with matching number $fracn-k2$ at most. This generalizes some results of O (2021) and Zhang (2022).

Full work available at URL: https://arxiv.org/abs/2203.13415

Recommendations

• On the maximal α-spectral radius of graphs with given matching number
• The maximum spectral radius of \(t\)-connected graphs with bounded matching number
• On the Aα-spectral radius of connected graphs
• On the \(A_\alpha\)-spectral radius of graphs without large matchings
• The maximal A_α-spectral radius of graphs with given matching number

zbMATH Keywords

connectivitymatchings\(A_\alpha\)-spectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Matching theory
• An introduction to the theory of graph spectra
• Title not available (Why is that?)
• Matchings in regular graphs from eigenvalues
• Edge-connectivity, eigenvalues, and matchings in regular graphs
• Cauchy's Interlace Theorem for Eigenvalues of Hermitian Matrices
• Bounds on the largest eigenvalues of trees with a given size of matching
• Title not available (Why is that?)
• Graphs determined by their \(A_\alpha\)-spectra
• Eigenvalues and perfect matchings
• Spectral radius of graphs with given matching number
• The \(A_\alpha\)-spectral radius and perfect matchings of graphs
• Merging the \(A\)- and \(Q\)-spectral theories
• A note on the positive semidefiniteness of \(A_{\alpha}(G)\)
• On the \(A_{\alpha}\)-spectra of trees
• On the \(A_\alpha\)-spectra of graphs
• On the spectrum of an equitable quotient matrix and its application
• A note on the \(A_{\alpha}\)-spectral radius of graphs
• Bounds on the second largest eigenvalue of a tree with perfect matchings
• On the \(A_{\alpha}\)-characteristic polynomial of a graph
• Spectral radius and matchings in graphs
• The maximum spectral radius of \(t\)-connected graphs with bounded matching number

Cited In (7)

• The maximal A_α-spectral radius of graphs with given matching number
• Bounding the \(A_\alpha\)-spectral radius of \(k\)-connected irregular graphs
• The average connectivity matrix of a graph
• \(A_{\alpha}\)-spectral extrema of graphs with given size and matching number
• The maximum spectral radius of \(t\)-connected graphs with bounded matching number
• On the maximal α-spectral radius of graphs with given matching number
• On the \(A_\alpha\)-spectral radius of graphs without large matchings

This page was built for publication: The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041869)