Open Access
Issue
Wuhan Univ. J. Nat. Sci.
Volume 30, Number 2, April 2025
Page(s) 118 - 124
DOI https://doi.org/10.1051/wujns/2025302118
Published online 16 May 2025

© Wuhan University 2025

Licence Creative CommonsThis is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

0 Introduction

All graphs considered are undirected, simple, and connected throughout this paper. Let GMathematical equation be a graph with vertex set V(G)Mathematical equation and edge set E(G)Mathematical equation. We denote by |V(G)|=nMathematical equation and |E(G)|=e(G)Mathematical equation the order and the size of GMathematical equation, respectively. Moreover, we write dG(u)Mathematical equation for the degree of vertex uMathematical equation in GMathematical equation, and NG(v)Mathematical equation for the neighbor set of vertex vMathematical equation in GMathematical equation. For any SV(G)Mathematical equation, let G[S]Mathematical equation be the subgraph of GMathematical equation induced by SMathematical equation, and let G-SMathematical equation be the subgraph induced by V(G)\SMathematical equation. The set of all edges between two vertex sets XMathematical equation and YMathematical equation is denoted by e(X,Y)Mathematical equation. For any two graphs GMathematical equation and HMathematical equation, we denote by GHMathematical equation the disjoint union of GMathematical equation and HMathematical equation. The join GHMathematical equation is the graph obtained from GHMathematical equation by adding all possible edges between V(G)Mathematical equation and V(H)Mathematical equation.

The adjacency matrix A(G)=(ai,j)Mathematical equation of GMathematical equation is a n×nMathematical equation symmetric matrix, whose entries ai,jMathematical equation are given by ai,j=1Mathematical equation if viMathematical equation and vjMathematical equation are adjacent in GMathematical equation, and ai,j=0Mathematical equation otherwise. The degree diagonal matrix of GMathematical equation is denoted by D(G)=diag(dG(v1),dG(v2),,dG(vn))Mathematical equation, where dG(vi)Mathematical equation is the degree of viMathematical equation in GMathematical equation. For any real α[0,1]Mathematical equation, Nikiforov[1] defined the AαMathematical equation-matrix of GMathematical equation as Aα(G)=αD(G)+(1-Mathematical equationα)A(G)Mathematical equation. The largest eigenvalue of Aα(G)Mathematical equation is called the AαMathematical equation-spectral radius of GMathematical equation, and denoted by ρα(G)Mathematical equation. Obviously, A0(G)=A(G)Mathematical equation, A1(G)=D(G)Mathematical equation and 2A1/2(G)=Q(G)Mathematical equation=D(G)+A(G)Mathematical equation, where Q(G)Mathematical equation is the signless Laplacian matrix of GMathematical equation. Note that Aα(G)Mathematical equation is a real symmetric non-negative matrix. By the Perron-Frobenius Theorem, ρα(G)Mathematical equation is a positive number and there exists a unique positive unit eigenvector corresponding to ρα(G)Mathematical equation, which is called the Perron vector of GMathematical equation.

A graph is kMathematical equation-extendable if each matching consisting of kMathematical equation edges can be extended to a perfect matching. Clearly, the existence of a perfect matching can be regarded as 0-extendability. The concept of kMathematical equation-extendability gradually evolved from the concept of elementary (that is, 1-extendable) bipartite graphs. In 1980, Plummer[2] gave the first results on kMathematical equation-extendable graphs for arbitrary kMathematical equation, he studied the properties of kMathematical equation-extendable graphs and proved that nearly all kMathematical equation-extendable graphs (k2)Mathematical equation are (k-1)Mathematical equation-extendable and (k+1)Mathematical equation-connected. Then Plummer[3-4] provided the relationships between the toughness and genus of a graph and the kMathematical equation-extendability of the graph. Moreover, many researchers further studied the relationship between kMathematical equation-extendability and other graph parameters, such as minimum degree, connectivity, binding number, and independence number etc[5-10].

In the past few years, much attention has been paid to the connections of the spectral radius and the kMathematical equation-extendable graphs. Fan and Lin[11] investigated the adjacency spectral conditions for a graph (as well as a balanced bipartite graph) with a minimum degree δMathematical equation to be kMathematical equation-extendable. In Ref. [12], Zhou and Zhang gave a lower bound on the signless Laplacian spectral radius to ensure that GMathematical equation is kMathematical equation-extendable. Then, Zhang and Dam[13] studied the kMathematical equation-extendability of graphs from a distance spectral perspective. The main goal of this paper is to study the relationship between kMathematical equation-extendability of graphs and the AαMathematical equation-spectral radius.

In the following, we first provide a condition for the kMathematical equation-extendability of matchings in a graph in terms of the AαMathematical equation-spectral radius.

Theorem 1   Let k1Mathematical equation be an integer, and let GMathematical equation be a connected graph of even order nMathematical equation with n>2k+4Mathematical equation. For α[0,1)Mathematical equation, if

ρ α ( G ) ρ α ( K 2 k ( K n - 2 k - 1 K 1 ) ) Mathematical equation

then GMathematical equation is kMathematical equation-extendable, unless GK2k(Kn-2k-1K1)Mathematical equation.

A bipartite graph is called balanced if both parts of the bipartition have equal size. Note that every bipartite graph with a perfect matching must be balanced. Hence a kMathematical equation-extendable bipartite graph must be balanced. Furthermore, we denote by n-k,n-1Mathematical equation the bipartite graph obtained from Kn,n-1Mathematical equation by attaching a vertex to kMathematical equation vertices in nMathematical equation-vertex part (see Fig. 1). In Ref. [13], Zhang and Dam gave a sufficient condition in terms of the distance spectral radius for the kMathematical equation-extendability of a bipartite graph. Along this line, we have the result below.

Thumbnail: Fig. 1 Refer to the following caption and surrounding text. Fig. 1 The extremal graph Bn-k,n-1Mathematical equation

Theorem 2   Let k1Mathematical equation be an integer, and let GMathematical equation be a connected balanced bipartite graph of order 2nMathematical equation with nk+1Mathematical equation. For α[0,1)Mathematical equation, if

ρ α ( G ) ρ α ( n - k , n - 1 ) Mathematical equation

then GMathematical equation is kMathematical equation-extendable, unless Gn-k,n-1Mathematical equation, see Fig. 1 for instance.

1 Preliminaries

In this section, we give several preliminary lemmas, which are useful to the proof of our main results.

For any SV(G)Mathematical equation, let o(G-S)Mathematical equation denote the number of odd components in G-SMathematical equation. In 1995, Chen[7] provided a necessary and sufficient condition for the existence of kMathematical equation-extendable graphs.

Lemma 1[7] Let k1Mathematical equation. A graph GMathematical equation is kMathematical equation-extendable if and only if

o ( G - S ) | S | - 2 k Mathematical equation

for any SV(G)Mathematical equation such that G[S]Mathematical equation contains kMathematical equation independent edges.

Lemma 2[1] If GMathematical equation is connected, and HMathematical equation is a proper subgraph of GMathematical equation, then ρα(H)<ρα(G)Mathematical equation for any α[0,1)Mathematical equation.

Given any XV(G)Mathematical equation, let N(X)Mathematical equation be the set of all neighbors of the vertices in XMathematical equation. In Ref. [14], Plummer gave the necessary and sufficient conditions for bipartite graphs to be kMathematical equation-extendable.

Lemma 3[14] Let k1Mathematical equation and let GMathematical equation be a connected bipartite graph with parts UMathematical equation and WMathematical equation. Then the following are equivalent:

(i) GMathematical equation is kMathematical equation-extendable;

(ii) |U|=|W|Mathematical equation and for all nonempty subsets XMathematical equation of UMathematical equation, if |X||U|-kMathematical equation, then |N(X)||X|+kMathematical equation;

(iii) For all u1,u2,,ukUMathematical equation and w1,w2,,wkWMathematical equation, the graph G'=G-{u1,,uk,w1,,wk}Mathematical equation has a perfect matching.

Finally, we need a known result mentioned as Claim 1 of the proof of Theorem 1.1 in Ref. [15].

Lemma 4[15] Let n1n2nq1Mathematical equation be positive integers and n=i=1qni+sMathematical equation. For α[0,1)Mathematical equation,we have ρα(Ks(Kn1Kn2Knq))ρα(Ks(Kn-s-q+1(q-1)K1))Mathematical equation, where the equality holds if and only if (n1,n2,,nq)=(n-s-q+1,1,,1)Mathematical equation.

2 Proof of Theorem 1

In this section, we elaborate on the proof of Theorem 1, which provides a sufficient condition via the AαMathematical equation-spectral radius of a connected graph to ensure that the graph is kMathematical equation-extendable.

Proof of Theorem 1   Suppose to the contrary that GMathematical equation is not kMathematical equation-extendable, we will prove that if GMathematical equation is not kMathematical equation-extendable, then ρα(G)ρα(K2k(Kn-2k-1K1))Mathematical equation with equality only if GK2kMathematical equation(Kn-2k-1K1)Mathematical equation. By Lemma 1, there exists some nonempty subset SV(G)Mathematical equation, such that |S|2kMathematical equation and o(G-S)>|S|-2kMathematical equation. For convenience, let o(G-S)=qMathematical equation and |S|=sMathematical equation. We assert that qMathematical equation and sMathematical equation have the same parity. If sMathematical equation is odd, then n-sMathematical equation is an odd number since nMathematical equation is even, and so, the number of odd components in G-SMathematical equation is odd, i.e., qMathematical equation is odd. Hence, qMathematical equation and sMathematical equation are odd. Similarly, we obtain that qMathematical equation is even if sMathematical equation is even. Thus, it concludes that qs-2k+2Mathematical equation. To promote the proof, we have the following three claims.

Claim 1 For some odd integers n1n2nq1Mathematical equation and i=1qni=n-sMathematical equation, GMathematical equation is a spanning subgraph of Ks(Kn1Kn2Knq)Mathematical equation.

Proof   Let G1,G2,,GqMathematical equation be the orders of the qMathematical equation odd components of G-SMathematical equation with |V(G1)|Mathematical equation|V(G2)||V(Gq)|Mathematical equation, and let H1,H2,,HpMathematical equation be the pMathematical equation even components of G-SMathematical equation. Without loss of generality, we assume that all even components join to component G1Mathematical equation, i.e.,G1(H1H2Mathematical equationHp)Mathematical equation. So, G1(H1H2Hp)Mathematical equation is the spanning subgraph of Kn1Mathematical equation for some integer n1=Mathematical equation|V(G1(H1H2Hp))|Mathematical equation, and |V(G1(H1H2Hp))|Mathematical equation is an odd integer. Let GiMathematical equation be the spanning subgraph of KniMathematical equation for some 2iqMathematical equation and ni=|V(Gi)|Mathematical equation. Then all components of G-SMathematical equation are odd and GMathematical equation is the spanning subgraph of G[S](G-S)Mathematical equation, and thus, GMathematical equation is a spanning subgraph of Ks(Kn1Kn2Knq)Mathematical equation for some odd integers n1n2nq1Mathematical equation and i=1qni=n-sMathematical equation.

Furthermore, by Lemma 2 we have ρα(G)ρα(Ks(Kn1Kn2Knq))Mathematical equation with equality holds if and only if GKs(Kn1Kn2Knq)Mathematical equation.

If n2=n3==nq=1Mathematical equation, then Ks(Kn1K1K1)Ks(Kn-s-(q-1)(q-1)K1)Mathematical equation, say G1Mathematical equation.

Hence, by Lemma 4 we have that ρα(Ks(Kn1Kn2Knq))ρα(Ks(Kn-s-q+1(q-1)K1))Mathematical equation, where the equality holds if and only if (n1,n2,,nq)=(n-s-q+1,1,,1)Mathematical equation.

Note that qs-2k+2Mathematical equation. Let G2Ks(Kn-2s+2k-1(s-2k+1)K1)Mathematical equation. We next compare the AαMathematical equation-spectral radius of G1Mathematical equation and G2Mathematical equation in the following.

Claim 2 For α[0,1)Mathematical equation, we have ρα(Ks(Kn-s-q+1(q-1)K1))ρα(Ks(Kn-2s+2k-1(s-2k+1)K1))Mathematical equation with equality holds if and only if q=s-2k+2Mathematical equation.

Proof   If q=s-2k+2Mathematical equation, we have Ks(Kn-s-q+1(q-1)K1)Ks(Kn-2s+2k-1(s-2k+1)Mathematical equationK1)Mathematical equation. Hence, ρα(KsMathematical equation

( K n - s - q + 1 ( q - 1 ) K 1 ) ) = ρ α ( K s ( K n - 2 s + 2 k - 1 ( s - 2 k + 1 ) K 1 ) ) Mathematical equation

Now we consider q>s-2k+2Mathematical equation. Clearly, qs-2k+4Mathematical equation since qMathematical equation and sMathematical equation has the same parity, here it is sufficient to prove ρα(Ks(Kn-s-q+1(q-1)K1))<ρα(Ks(Kn-2s+2k-1(s-2k+1)K1))Mathematical equation for qs-2k+4Mathematical equation. We notice that n=s+i=1qni2s-2k+2Mathematical equation, G1Ks(Kn-s-(q-1)(q-1)K1)Mathematical equation and G2Mathematical equationKs(Kn-2s+2k-1(s-2k+1)K1))Mathematical equation.

Suppose that XMathematical equation is the unit Perron eigenvector of Aα(G1)Mathematical equation, and XuMathematical equation denotes the entry of XMathematical equation corresponding to the vertex uV(G1)Mathematical equation. From the equitable partition V(G1)=V(Ks)V(Kn-s-q+1)Mathematical equation(V((q-s+2k-2)K1)V((s-2k+1)K1)Mathematical equation, we have that V(Ks)Mathematical equation, V(Kn-s-q+1)Mathematical equation and V((q-1)K1)Mathematical equation has the same entries in XMathematical equation. Let Xu=x1Mathematical equation for uV(Ks)Mathematical equation, Xv=x2Mathematical equation for vV(Kn-s-q+1)Mathematical equation and Xw=x3Mathematical equation for wV((q-1)K1)Mathematical equation, respectively. For convenience, we write XMathematical equation as follows:

X = ( x 1 , , x 1 s , x 2 , , x 2 n - s - q + 1 , x 3 , , x 3 q - s + 2 k - 2 , x 3 , , x 3 s - 2 k + 1 ) T Mathematical equation

For the graph G2Mathematical equation, we partition V(G2)Mathematical equation as V(Ks)V(Kn-s-q+1)V(Kq-s+2k-2)V((s-2k+1)Mathematical equationK1)Mathematical equation. Thus, Aα(G2)-Aα(G1)Mathematical equation has the form of a block matrix below:

( O n 1 × n 1 O n 1 × n 2 O n 1 × n 3 O n 1 × n 4 O n 2 × n 1 α ( q - s + 2 k - 2 ) I n 2 × n 2 ( 1 - α ) I n 2 × n 3 O n 2 × n 4 O n 3 × n 1 ( 1 - α ) I n 3 × n 2 α ( n - 2 s + 2 k - 2 ) I n 3 × n 3 + ( 1 - α ) ( J - I ) n 3 × n 3 O n 3 × n 4 O n 4 × n 1 O n 4 × n 2 O n 4 × n 3 O n 4 × n 4 ) Mathematical equation

where n1=sMathematical equation,n2=n-s-q+1Mathematical equation,n3=q-s+2k-2Mathematical equation and n4=s-2k+1Mathematical equation, meanwhile, JMathematical equation is an all-ones matrix and IMathematical equation is an identity matrix.

Furthermore, by Rayleigh's principle, we have

ρ α ( G 2 ) - ρ α ( G 1 ) X T ( A α ( G 2 ) - A α ( G 1 ) ) X = α ( q - s + 2 k - 2 ) ( ( n - s - q + 1 ) x 2 2 + ( n - 2 s + 2 k - 2 ) x 3 2 ) + ( 1 - α ) ( q - s + 2 k - 2 )    × ( 2 ( n - s - q + 1 ) x 2 x 3 + ( q - s + 2 k - 3 ) x 3 2 ) = ( q - s + 2 k - 2 ) ( α ( ( n - s - q + 1 ) x 2 2 + ( n - 2 s + 2 k - 2 ) x 3 2 ) + ( 1 - α ) ( 2 ( n - s - q + 1 )     x 2 x 3 + ( q - s + 2 k - 3 ) x 3 2 ) ) 2 ( α ( ( n - s - q + 1 ) x 2 2 + ( n - 2 s + 2 k - 2 ) x 3 2 ) + ( 1 - α ) ( ( n - s - q + 1 ) 2 x 2 x 3 + x 3 2 ) )     ( s i n c e   q s - 2 k + 4 ) 2 ( α ( n - s - q + 1 ) x 2 2 + ( 1 - α ) ( ( n - s - q + 1 ) 2 x 2 x 3 + x 3 2 ) )   ( s i n c e   n 2 s - 2 k + 2 ) > 0 . Mathematical equation

Therefore, ρα(Ks(Kn-s-q+1(q-1)K1))<ρα(Ks(Kn-2s+2k-1(s-2k+1)K1))Mathematical equation.

Recall that s2kMathematical equation. Let G3K2k(Kn-2k-1K1)Mathematical equation. Next, we compare the AαMathematical equation-spectral radius of G2Mathematical equation and G3Mathematical equation and give the following claim.

Claim 3 Let k1Mathematical equation and n>2k+4Mathematical equation. For α[0,1)Mathematical equation, we have ρα(Ks(Kn-2s+2k-1(s-2k+1)K1))ρα(K2k(Kn-2k-1K1))Mathematical equation

with equality holds if and only if s=2kMathematical equation.

Proof   If s=2kMathematical equation, we have Ks(Kn-2s+2k-1(s-2k+1)K1)K2k(Kn-2k-1K1)Mathematical equation. Hence, ρα(Ks(Kn-2s+2k-1(s-2k+1)K1))=ρα(K2k(Kn-2k-1K1))Mathematical equation.

If s2k+1Mathematical equation, we should verify that ρα(Ks(Kn-2s+2k-1(s-2k+1)K1))<ρα(K2k(Kn-2k-1Mathematical equationK1))Mathematical equation. Since n2s-2k+2Mathematical equation we have sn2+k-1Mathematical equation. Thus, it concludes that 2k+1sn2+k-1Mathematical equation. Note that G2Ks(Kn-2s+2k-1(s-2k+1)K1)Mathematical equation and G3K2k(Kn-2k-1K1)Mathematical equation.

Let YMathematical equation be the unit Perron eigenvector of Aα(G3)Mathematical equation, and YvMathematical equation be the entry of YMathematical equation corresponding to the vertex vV(G3)Mathematical equation. Since V(G3)=V(K2k)(V(Ks-2k)V(Kn-2s+2k-1)V(Ks-2k))Mathematical equationV(K1)Mathematical equation is an equitable partition of G3Mathematical equation, YMathematical equation takes the same value on the vertices of V(K2k)Mathematical equation (respectively V(Kn-2k-1)Mathematical equation and V(K1)Mathematical equation). Let Yu=y1Mathematical equation for uV(K2k)Mathematical equation, Yv=y2Mathematical equation for vV(Kn-2k-1)Mathematical equation and Yw=y3Mathematical equation for wV(K1)Mathematical equation, then YMathematical equation can be written below:

Y = ( y 1 , , y 1 2 k , y 2 , , y 2 s - 2 k , y 2 , , y 2 n - 2 s + 2 k - 1 , y 2 , , y 2 s - 2 k , y 3 ) T Mathematical equation

Let V(G2)=V(Ks)V(Kn-s-q+1)V(Kq-s+2k-2)V((s-2k+1)K1)Mathematical equation. Then Aα(G3)-Aα(G2)Mathematical equation can be partitioned as

( O m 1 × m 1 O m 1 × m 2 O m 1 × m 3 O m 1 × m 2 O m 1 × 1 O m 2 × m 1 - α I m 2 × m 2 O m 2 × m 3 O m 2 × m 2 - ( 1 - α ) I m 2 × 1 O m 3 × m 1 O m 3 × m 2 α ( s - 2 k ) I m 3 × m 3 ( 1 - α ) I m 3 × m 2 O m 3 × 1 O m 2 × m 1 O m 2 × m 2 ( 1 - α ) I m 2 × m 3 α ( n - s - 2 ) I m 2 × m 2 + ( 1 - α ) ( J - I ) m 2 × m 2 O m 2 × 1 O 1 × m 1 - ( 1 - α ) I 1 × m 2 O 1 × m 3 O 1 × m 2 α ( 2 k - s ) I 1 × 1 ) Mathematical equation

where m1=2kMathematical equation, m2=s-2kMathematical equation and m3=n-2s+2k-1Mathematical equation.

Thus, by Aα(G3)Y=ρα(G3)YMathematical equation, we can get that

ρ α ( G 3 ) y 2 = α ( n - 2 ) y 2 + ( 1 - α ) ( 2 k y 1 + ( n - 2 k - 2 ) y 2 ) Mathematical equation(1)

ρ α ( G 3 ) y 3 = α ( 2 k ) y 3 + ( 1 - α ) 2 k y 1 Mathematical equation(2)

Hence, it follows from Eqs. (1) and (2) that

( ρ α ( G 3 ) - 2 α k - ( n - 2 k - 2 ) ) y 2 = ( ρ α ( G 3 ) - 2 α k ) y 3 Mathematical equation

which implies y2>y3Mathematical equation.

According to the Rayleigh quotient, we derive that

ρ α ( G 3 ) - ρ α ( G 2 ) Y T ( A α ( G 3 ) - A α ( G 2 ) ) Y = α ( ( s - 2 k ) ( 2 n - 3 s + 2 k - 4 ) y 2 2 + ( 2 k - s ) y 3 2 ) + ( 1 - α ) ( ( s - 2 k ) ( 2 n - 3 s + 2 k - 3 ) y 2 2 - 2 ( s - 2 k ) y 2 y 3 ) = ( s - 2 k ) ( α ( ( 2 n - 3 s + 2 k - 4 ) y 2 2 - y 3 2 ) + ( 1 - α ) ( ( 2 n - 3 s + 2 k - 3 ) y 2 2 - 2 y 2 y 3 ) ) > ( s - 2 k ) ( α ( ( 2 n - 3 s + 2 k - 4 ) y 2 2 - y 2 2 ) + ( 1 - α ) ( ( 2 n - 3 s + 2 k - 3 ) y 2 2 - 2 y 2 2 ) ) ( s i n c e   y 2 > y 3 ) = ( s - 2 k ) ( α ( 2 n - 3 s + 2 k - 5 ) y 2 2 + ( 1 - α ) ( 2 n - 3 s + 2 k - 5 ) y 2 2 ) = ( s - 2 k ) ( 2 n - 3 s + 2 k - 5 ) y 2 2 > 0   ( s i n c e   2 k s n 2 + k - 1   a n d   n > 2 k + 4 ) . Mathematical equation

Thus, ρα(Ks(Kn-2s+2k-1(s-2k+1)K1))<ρα(K2k(Kn-2k-1K1))Mathematical equation.

Moreover, we prove that K2k(Kn-2k-1K1)Mathematical equation is not kMathematical equation-extendable. Set V1=V(K2k)Mathematical equation, V2=Mathematical equationV(Kn-2k-1)Mathematical equation and V3=V(K1)Mathematical equation, we take a nonempty subset S=V1Mathematical equation, then o(G-S)=2>|S|-2kMathematical equation. Hence, Lemma 1 deduces that K2k(Kn-2k-1K1)Mathematical equation is not kMathematical equation-extendable. Therefore, the proof is completed.

3 Proof of Theorem 2

In this section, we will present a comprehensive proof of Theorem 2.

Proof of Theorem 2   Suppose, by a contradiction, that GMathematical equation is not kMathematical equation-extendable. We will prove that if GMathematical equation is connected balanced bipartite but not kMathematical equation-extendable, then ρα(G)Mathematical equationρα(n-k,n-1)Mathematical equation with equality holds if and only if Gn-k,n-1Mathematical equation.

Let G=G [U,W]Mathematical equation be a connected balanced bipartite graph, where |U|=|W|=nMathematical equation. Since GMathematical equation is not kMathematical equation-extendable, by Lemma 3, there exists some nonempty subset XUMathematical equation such that |N(X)|Mathematical equation|X|+k-1Mathematical equation and |X|n-kMathematical equation. Let |X|,|N(X)|Mathematical equation be the connected balanced bipartite graph be obtained from GMathematical equation by joining XMathematical equation and N(X)Mathematical equation as well as joining U-XMathematical equation and W-N(X)Mathematical equation, and by adding all possible edges between U-XMathematical equation and N(X)Mathematical equation, i.e., |X|,|N(X)|K|X|,|N(X)|Kn-|X|,n-|N(X)|Mathematical equation+e(N(X),U-X)Mathematical equation.

For convenience, we may set |X|=sMathematical equation. It is clear then that GMathematical equation is a spanning subgraph of s,s+k-1Mathematical equation, and

s , s + k - 1 K s , s + k - 1 K n - s , n - s - k + 1 + e ( N ( X ) , U - X ) . Mathematical equation

By Lemma 2, we can deduce that

ρ α ( G ) ρ α ( s , s + k - 1 ) Mathematical equation

with equality holds if and only if Gs,s+k-1Mathematical equation.

If s=1Mathematical equation or s=n-kMathematical equation, then 1,k=n-k,n-1Mathematical equation, which is the claimed extremal graph. By the symmetry of s,s+k-1=n-k-s+1,n-sMathematical equation, we need to prove ρα(s,s+k-1)<ρα(n-k,n-1)Mathematical equation for 2s12(n-k+1)Mathematical equation.

Let ZMathematical equation be the unit Perron eigenvector of Aα(n-k,n-1)Mathematical equation, and ZuMathematical equation denotes the entry of ZMathematical equation corresponding to the vertex uV(n-k,n-1)Mathematical equation. It is easy to see that V(n-k,n-1)=(V(sK1)V((n-k-Mathematical equations)K1))V(kK1)(V((s+k-1)K1)V((n-s-k)K1))V(K1)Mathematical equation is an equitable partition of n-k,n-1Mathematical equation, and so, all vertices of V((n-k)K1)Mathematical equation (respectively V(kK1)Mathematical equation, V((n-1)K1)Mathematical equation and V(K1)Mathematical equation) have the same entries in ZMathematical equation. Then we may set Zu=z1Mathematical equation for uV((n-k)K1)Mathematical equation, Zv=z2Mathematical equation for vV(kK1)Mathematical equation, Zw=z3Mathematical equation for wV((n-1)K1)Mathematical equation and Zt=z4Mathematical equation for tV(K1)Mathematical equation, respectively. So, we write

Z = ( z 1 , , z 1 s , z 1 , , z 1 n - k - s , z 2 , , z 2 k , z 3 , , z 3 s + k - 1 , z 3 , , z 3 n - s - k , z 4 ) T Mathematical equation

Let V(s,s+k-1)=V(sK1)V((n-k-s)K1)V(kK1)V((s+k-1)K1)V((n-s-k)K1)V(K1)Mathematical equation. Then one can partition Aα(n-k,n-1)-Aα(s,s+k-1)Mathematical equation as follows:

( α ( n - s - k ) I n 1 × n 1 O n 1 × n 2 O n 1 × n 3 O n 1 × n 4 ( 1 - α ) I n 1 × n 2 O n 1 × 1 O n 2 × n 1 - α I n 2 × n 2 O n 2 × n 3 O n 2 × n 4 O n 2 × n 2 - ( 1 - α ) I n 2 × 1 O n 3 × n 1 O n 3 × n 2 O n 3 × n 3 O n 3 × n 4 O n 3 × n 2 O n 3 × 1 O n 4 × n 1 O n 4 × n 2 O n 4 × n 3 O n 4 × n 4 O n 4 × n 2 O n 4 × 1 ( 1 - α ) I n 2 × n 1 O n 2 × n 2 O n 2 × n 3 O n 2 × n 4 α s I n 2 × n 2 O n 2 × 1 O 1 × n 1 - ( 1 - α ) I 1 × n 2 O 1 × n 3 O 1 × n 4 O 1 × n 2 α ( k - n + s ) I 1 × 1 ) Mathematical equation

where n1=sMathematical equation, n2=n-k-sMathematical equation, n3=kMathematical equation and n4=s+k-1Mathematical equation.

Thus, by Aα(n-k,n-1)Z=ρα(n-k,n-1)ZMathematical equation, we can get

ρ α ( n - k , n - 1 ) z 1 = α ( n - 1 ) z 1 + ( 1 - α ) ( n - 1 ) z 3 Mathematical equation(3)

ρ α ( n - k , n - 1 ) z 3 = α n z 3 + ( 1 - α ) ( ( n - k ) z 1 + k z 2 ) Mathematical equation(4)

ρ α ( n - k , n - 1 ) z 4 = α k z 4 + ( 1 - α ) ( k z 2 ) Mathematical equation(5)

Now, from Eq. (3) we have

z 1 = ( 1 - α ) ( n - 1 ) ρ α ( n - k , n - 1 ) - α ( n - 1 ) z 3 Mathematical equation(6)

Moreover, by Eqs. (4) and (5) we deduce that

( ρ α ( n - k , n - 1 ) - α n ) z 3 - ( 1 - α ) ( n - k ) z 1 = ( ρ α ( n - k , n - 1 ) - α k ) z 4 Mathematical equation(7)

Consequently, combining with Eqs. (6) and (7) we have

( ρ α ( n - k , n - 1 ) - α n - ( 1 - α ) 2 ( n - k ) ( n - 1 ) ρ α ( n - k , n - 1 ) - α ( n - 1 ) ) z 3 = ( ρ α ( n - k , n - 1 ) - α k ) z 4 Mathematical equation

which implies that z3>z4Mathematical equation.

Moreover, by Rayleigh's principle, we can get

ρ α ( n - k , n - 1 ) - ρ α ( s , s + k - 1 ) Z T ( A α ( n - k , n - 1 ) - A α ( s , s + k - 1 ) ) Z = α ( ( n - s - k ) ( s - 1 ) z 1 2 + s ( n - s - k ) z 3 2 + ( k - n + s ) z 4 2 ) + ( 1 - α ) ( 2 s ( n - s - k ) z 1 z 3 - 2 ( n - s - k ) z 1 z 4 ) = ( n - s - k ) ( α ( ( s - 1 ) z 1 2 + s z 3 2 - z 4 2 ) + ( 1 - α ) ( 2 s z 1 z 3 - 2 z 1 z 4 ) ) > ( n - s - k ) ( α ( ( s - 1 ) z 1 2 + s z 3 2 - z 3 2 ) + ( 1 - α ) ( 2 s z 1 z 3 - 2 z 1 z 3 ) )   ( s i n c e   z 3 > z 4 ) = ( n - s - k ) ( α ( ( s - 1 ) z 1 2 + ( s - 1 ) z 3 2 ) + ( 1 - α ) ( 2 ( s - 1 ) z 1 z 3 ) ) > 0   ( s i n c e   2 s 1 2 ( n - k + 1 ) ) . Mathematical equation

Hence, it deduces that ρα(n-k,n-1)>ρα(s,s+k-1)Mathematical equation. Note that the graph n-k,n-1Mathematical equation is not kMathematical equation-extendable. Therefore, this completes the proof of Theorem 2.

References

  1. Nikiforov V. Merging the A- and Q-spectral theories[J]. Applicable Analysis and Discrete Mathematics, 2017, 11(1): 81-107. [Google Scholar]
  2. Plummer M D. On n-extendable graphs[J]. Discrete Mathematics, 1980, 31(2): 201-210. [Google Scholar]
  3. Plummer M D. Toughness and matching extension in graphs[J]. Discrete Mathematics, 1988, 72(1): 311-320. [Google Scholar]
  4. Plummer M D. Matching extension and the genus of a graph[J]. Journal of Combinatorial Theory, Series B, 1988, 44(3): 329-337. [Google Scholar]
  5. Ananchuen N, Caccetta L. Matching extension and minimum degree[J]. Discrete Mathematics, 1997, 170(1/2/3): 1-13. [Google Scholar]
  6. Lou D J, Yu Q L. Connectivity of k-extendable graphs with large k[J]. Discrete Applied Mathematics, 2004, 136(1): 55-61. [Google Scholar]
  7. Chen C P. Binding number and toughness for matching extension[J]. Discrete Mathematics, 1995, 146(1/2/3): 303-306. [Google Scholar]
  8. Robertshaw A M, Woodall D R. Binding number conditions for matching extension[J]. Discrete Mathematics, 2002, 248(1/2/3): 169-179. [Google Scholar]
  9. Maschlanka P, Volkmann L. Independence number in n-extendable graphs[J]. Discrete Mathematics, 1996, 154(1/2/3): 167-178. [Google Scholar]
  10. Ananchuen N, Caccetta L. A note of k-extendable graphs and independence number[J]. Australasian Journal of Combinatorics, 1995, 12: 59-65. [Google Scholar]
  11. Fan D D, Lin H Q. Spectral conditions for k-extendability and k-factors of bipartite graphs[EB/OL]. [2024-03-08]. https://doi.org/10.48550/arXiv.2211.09304. [Google Scholar]
  12. Zhou S Z, Zhang Y L. Signless Laplacian spectral radius for a k-extendable graph[EB/OL]. [2024-03-08]. https://doi.org/10.48550/arXiv.2303.16687. [Google Scholar]
  13. Zhang Y K, van Dam E R. Matching extension and distance spectral radius[J]. Linear Algebra and Its Applications, 2023, 674: 244-255. [Google Scholar]
  14. Plummer M D. Matching extension in bipartite graphs[J]. Congressus Numerantium, 1986, 54 : 245-258. [Google Scholar]
  15. Zhao Y H, Huang X Y, Wang Z W. The A-spectral radius and perfect matchings of graphs[J]. Linear Algebra and Its Applications, 2021, 631: 143-155. [Google Scholar]

All Figures

Thumbnail: Fig. 1 Refer to the following caption and surrounding text. Fig. 1 The extremal graph Bn-k,n-1Mathematical equation
In the text

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.