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 G be a graph with vertex set V(G) and edge set E(G). We denote by |V(G)|=n and |E(G)|=e(G) the order and the size of G, respectively. Moreover, we write dG(u) for the degree of vertex u in G, and NG(v) for the neighbor set of vertex v in G. For any SV(G), let G[S] be the subgraph of G induced by S, and let G-S be the subgraph induced by V(G)\S. The set of all edges between two vertex sets X and Y is denoted by e(X,Y). For any two graphs G and H, we denote by GH the disjoint union of G and H. The join GH is the graph obtained from GH by adding all possible edges between V(G) and V(H).

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

A graph is k-extendable if each matching consisting of k edges can be extended to a perfect matching. Clearly, the existence of a perfect matching can be regarded as 0-extendability. The concept of k-extendability gradually evolved from the concept of elementary (that is, 1-extendable) bipartite graphs. In 1980, Plummer[2] gave the first results on k-extendable graphs for arbitrary k, he studied the properties of k-extendable graphs and proved that nearly all k-extendable graphs (k2) are (k-1)-extendable and (k+1)-connected. Then Plummer[3-4] provided the relationships between the toughness and genus of a graph and the k-extendability of the graph. Moreover, many researchers further studied the relationship between k-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 k-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 δ to be k-extendable. In Ref. [12], Zhou and Zhang gave a lower bound on the signless Laplacian spectral radius to ensure that G is k-extendable. Then, Zhang and Dam[13] studied the k-extendability of graphs from a distance spectral perspective. The main goal of this paper is to study the relationship between k-extendability of graphs and the Aα-spectral radius.

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

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

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

then G is k-extendable, unless GK2k(Kn-2k-1K1).

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 k-extendable bipartite graph must be balanced. Furthermore, we denote by n-k,n-1 the bipartite graph obtained from Kn,n-1 by attaching a vertex to k vertices in n-vertex part (see Fig. 1). In Ref. [13], Zhang and Dam gave a sufficient condition in terms of the distance spectral radius for the k-extendability of a bipartite graph. Along this line, we have the result below.

thumbnail Fig. 1 The extremal graph Bn-k,n-1

Theorem 2   Let k1 be an integer, and let G be a connected balanced bipartite graph of order 2n with nk+1. For α[0,1), if

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

then G is k-extendable, unless Gn-k,n-1, 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), let o(G-S) denote the number of odd components in G-S. In 1995, Chen[7] provided a necessary and sufficient condition for the existence of k-extendable graphs.

Lemma 1[7] Let k1. A graph G is k-extendable if and only if

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

for any SV(G) such that G[S] contains k independent edges.

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

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

Lemma 3[14] Let k1 and let G be a connected bipartite graph with parts U and W. Then the following are equivalent:

(i) G is k-extendable;

(ii) |U|=|W| and for all nonempty subsets X of U, if |X||U|-k, then |N(X)||X|+k;

(iii) For all u1,u2,,ukU and w1,w2,,wkW, the graph G'=G-{u1,,uk,w1,,wk} 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 n1n2nq1 be positive integers and n=i=1qni+s. For α[0,1),we have ρα(Ks(Kn1Kn2Knq))ρα(Ks(Kn-s-q+1(q-1)K1)), where the equality holds if and only if (n1,n2,,nq)=(n-s-q+1,1,,1).

2 Proof of Theorem 1

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

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

Claim 1 For some odd integers n1n2nq1 and i=1qni=n-s, G is a spanning subgraph of Ks(Kn1Kn2Knq).

Proof   Let G1,G2,,Gq be the orders of the q odd components of G-S with |V(G1)||V(G2)||V(Gq)|, and let H1,H2,,Hp be the p even components of G-S. Without loss of generality, we assume that all even components join to component G1, i.e.,G1(H1H2Hp). So, G1(H1H2Hp) is the spanning subgraph of Kn1 for some integer n1=|V(G1(H1H2Hp))|, and |V(G1(H1H2Hp))| is an odd integer. Let Gi be the spanning subgraph of Kni for some 2iq and ni=|V(Gi)|. Then all components of G-S are odd and G is the spanning subgraph of G[S](G-S), and thus, G is a spanning subgraph of Ks(Kn1Kn2Knq) for some odd integers n1n2nq1 and i=1qni=n-s.

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

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

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

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

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

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

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

Now we consider q>s-2k+2. Clearly, qs-2k+4 since q and s 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)) for qs-2k+4. We notice that n=s+i=1qni2s-2k+2, G1Ks(Kn-s-(q-1)(q-1)K1) and G2Ks(Kn-2s+2k-1(s-2k+1)K1)).

Suppose that X is the unit Perron eigenvector of Aα(G1), and Xu denotes the entry of X corresponding to the vertex uV(G1). From the equitable partition V(G1)=V(Ks)V(Kn-s-q+1)(V((q-s+2k-2)K1)V((s-2k+1)K1), we have that V(Ks), V(Kn-s-q+1) and V((q-1)K1) has the same entries in X. Let Xu=x1 for uV(Ks), Xv=x2 for vV(Kn-s-q+1) and Xw=x3 for wV((q-1)K1), respectively. For convenience, we write X 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

For the graph G2, we partition V(G2) as V(Ks)V(Kn-s-q+1)V(Kq-s+2k-2)V((s-2k+1)K1). Thus, Aα(G2)-Aα(G1) 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 )

where n1=s,n2=n-s-q+1,n3=q-s+2k-2 and n4=s-2k+1, meanwhile, J is an all-ones matrix and I 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 .

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

Recall that s2k. Let G3K2k(Kn-2k-1K1). Next, we compare the Aα-spectral radius of G2 and G3 and give the following claim.

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

with equality holds if and only if s=2k.

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

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

Let Y be the unit Perron eigenvector of Aα(G3), and Yv be the entry of Y corresponding to the vertex vV(G3). Since V(G3)=V(K2k)(V(Ks-2k)V(Kn-2s+2k-1)V(Ks-2k))V(K1) is an equitable partition of G3, Y takes the same value on the vertices of V(K2k) (respectively V(Kn-2k-1) and V(K1)). Let Yu=y1 for uV(K2k), Yv=y2 for vV(Kn-2k-1) and Yw=y3 for wV(K1), then Y 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

Let V(G2)=V(Ks)V(Kn-s-q+1)V(Kq-s+2k-2)V((s-2k+1)K1). Then Aα(G3)-Aα(G2) 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 )

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

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

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

ρ α ( G 3 ) y 3 = α ( 2 k ) y 3 + ( 1 - α ) 2 k y 1 (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

which implies y2>y3.

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 ) .

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

Moreover, we prove that K2k(Kn-2k-1K1) is not k-extendable. Set V1=V(K2k), V2=V(Kn-2k-1) and V3=V(K1), we take a nonempty subset S=V1, then o(G-S)=2>|S|-2k. Hence, Lemma 1 deduces that K2k(Kn-2k-1K1) is not k-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 G is not k-extendable. We will prove that if G is connected balanced bipartite but not k-extendable, then ρα(G)ρα(n-k,n-1) with equality holds if and only if Gn-k,n-1.

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

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

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

By Lemma 2, we can deduce that

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

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

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

Let Z be the unit Perron eigenvector of Aα(n-k,n-1), and Zu denotes the entry of Z corresponding to the vertex uV(n-k,n-1). It is easy to see that V(n-k,n-1)=(V(sK1)V((n-k-s)K1))V(kK1)(V((s+k-1)K1)V((n-s-k)K1))V(K1) is an equitable partition of n-k,n-1, and so, all vertices of V((n-k)K1) (respectively V(kK1), V((n-1)K1) and V(K1)) have the same entries in Z. Then we may set Zu=z1 for uV((n-k)K1), Zv=z2 for vV(kK1), Zw=z3 for wV((n-1)K1) and Zt=z4 for tV(K1), 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

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). Then one can partition Aα(n-k,n-1)-Aα(s,s+k-1) 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 )

where n1=s, n2=n-k-s, n3=k and n4=s+k-1.

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

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

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

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

Now, from Eq. (3) we have

z 1 = ( 1 - α ) ( n - 1 ) ρ α ( n - k , n - 1 ) - α ( n - 1 ) z 3 (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 (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

which implies that z3>z4.

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 ) ) .

Hence, it deduces that ρα(n-k,n-1)>ρα(s,s+k-1). Note that the graph n-k,n-1 is not k-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 The extremal graph Bn-k,n-1
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.