Matching, odd [1,b]-factor and distance spectral radius of graphs with given some parameters
Filomat · 2025 · 39 (22) · 7781-7795
DOI: 10.2298/fil2522781x ↗Kurz gefasst
Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Zengzhao Xu und 2 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).
Abstract (Originalsprache)
For a connected graph G , let \mu(G) denote the distance spectral radius of G . A matching in a graph G is a set of disjoint edges of G . The maximum size of a matching in G is called the matching number of G , denoted by \alpha(G) . An odd [1,b] -factor of a graph G is a spanning subgraph G_0 such that the degree d_{G_0}(v) of v in G_0 is odd and 1 \le d_{G_0}(v) \le b for every vertex v \in V(G) . In this paper, we give a sharp upper bound in terms of the distance spectral radius to guarantee \alpha(G) > \frac{n-k}{2} in an n -vertex t -connected graph G , where 2 \le k \le n-2 is an integer. We also present a sharp upper bound in terms of distance spectral radius for the existence of an odd [1,b] -factor in a graph with given minimum degree \delta .
Zitieren
APA
Xu, Z., Xi, W., & Wang, L. (2025). Matching, odd [1,b]-factor and distance spectral radius of graphs with given some parameters. Filomat, 39(22), 7781-7795. https://doi.org/10.2298/fil2522781x
Vancouver
Xu Z, Xi W, Wang L. Matching, odd [1,b]-factor and distance spectral radius of graphs with given some parameters. Filomat. 2025;39(22):7781-7795. doi:10.2298/fil2522781x
BibTeX
@article{Xu2025,
author = {Xu, Zengzhao and Xi, Weige and Wang, Ligong},
title = {Matching, odd [1,b]-factor and distance spectral radius of graphs with given some parameters},
journal = {Filomat},
year = {2025},
volume = {39},
number = {22},
pages = {7781--7795},
doi = {10.2298/fil2522781x}
}
EUVIMED