Matching extension and distance spectral radius

Yuke Zhang; Edwin R. van Dam

doi:10.1016/j.laa.2023.06.002

Matching extension and distance spectral radius

Yuke Zhang^*
, Edwin R. van Dam

^*Corresponding author for this work

Research output: Contribution to journal › Article › Scientific › peer-review

3 Citations (Scopus)

133 Downloads (Pure)

Abstract

A graph is called k-extendable if each k-matching can be extended to a perfect matching. We give spectral conditions for the k-extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations. Concretely, we give a sufficient condition in terms of the spectral radius of the distance matrix for the k-extendability of a graph and completely characterize the corresponding extremal graphs. A similar result is obtained for bipartite graphs.

Original language	English
Pages (from-to)	244-255
Number of pages	12
Journal	Linear Algebra and its Applications
Volume	674
DOIs	https://doi.org/10.1016/j.laa.2023.06.002
Publication status	Published - 1 Oct 2023

Keywords

Distance spectral radius
Extendability
Matching

Access to Document

10.1016/j.laa.2023.06.002

Matching extension and distance spectral radius. Final published version, 334 KBLicence: Taverne

Cite this

@article{4a0d9f5694394b02a9ec8e0e957e4ff0,

title = "Matching extension and distance spectral radius",

abstract = "A graph is called k-extendable if each k-matching can be extended to a perfect matching. We give spectral conditions for the k-extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations. Concretely, we give a sufficient condition in terms of the spectral radius of the distance matrix for the k-extendability of a graph and completely characterize the corresponding extremal graphs. A similar result is obtained for bipartite graphs.",

keywords = "Distance spectral radius, Extendability, Matching",

author = "Yuke Zhang and \{van Dam\}, \{Edwin R.\}",

note = "Publisher Copyright: {\textcopyright} 2023 Elsevier Inc.",

year = "2023",

month = oct,

day = "1",

doi = "10.1016/j.laa.2023.06.002",

language = "English",

volume = "674",

pages = "244--255",

journal = "Linear Algebra and its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Matching extension and distance spectral radius

AU - Zhang, Yuke

AU - van Dam, Edwin R.

PY - 2023/10/1

Y1 - 2023/10/1

N2 - A graph is called k-extendable if each k-matching can be extended to a perfect matching. We give spectral conditions for the k-extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations. Concretely, we give a sufficient condition in terms of the spectral radius of the distance matrix for the k-extendability of a graph and completely characterize the corresponding extremal graphs. A similar result is obtained for bipartite graphs.

AB - A graph is called k-extendable if each k-matching can be extended to a perfect matching. We give spectral conditions for the k-extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations. Concretely, we give a sufficient condition in terms of the spectral radius of the distance matrix for the k-extendability of a graph and completely characterize the corresponding extremal graphs. A similar result is obtained for bipartite graphs.

KW - Distance spectral radius

KW - Extendability

KW - Matching

U2 - 10.1016/j.laa.2023.06.002

DO - 10.1016/j.laa.2023.06.002

M3 - Article

AN - SCOPUS:85161623382

SN - 0024-3795

VL - 674

SP - 244

EP - 255

JO - Linear Algebra and its Applications

JF - Linear Algebra and its Applications

ER -

Matching extension and distance spectral radius

Abstract

Keywords

Access to Document

Fingerprint

Cite this