Signless Laplacian spectral conditions for even factors in graphs
Discrete Applied Mathematics · 2026-07 · 387 · 209-214
DOI: 10.1016/j.dam.2026.02.055 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-07. Verfasst von Lu Li und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 23 Literaturangaben. Gefördert von: Huaibei Normal University, Hubei Provincial Department of Education, National Natural Science Foundation of China.
Abstract (Originalsprache)
A spanning subgraph $F$ of a graph $G$ is defined as an even factor of $G$, if the degree $d_F(v)=2k, k\in\mathbb{N}^+$ for every vertex $v\in V(G)$. This note establishes a sufficient condition to ensure that a connected graph $G$ of even order with the minimum degree $\delta$ contains an even factor based on the signless Laplacian spectral radius.
Förderung
- Huaibei Normal University
- Hubei Provincial Department of Education
- National Natural Science Foundation of China
- Hubei Province Natural Science Foundation
Zitieren
APA
Li, L., Liu, H., Hua, H., & Du, Z. (2026). Signless Laplacian spectral conditions for even factors in graphs. Discrete Applied Mathematics, 387, 209-214. https://doi.org/10.1016/j.dam.2026.02.055
Vancouver
Li L, Liu H, Hua H, Du Z. Signless Laplacian spectral conditions for even factors in graphs. Discrete Applied Mathematics. 2026;387:209-214. doi:10.1016/j.dam.2026.02.055
BibTeX
@article{Li2026,
author = {Li, Lu and Liu, Hechao and Hua, Hongbo and Du, Zenan},
title = {Signless Laplacian spectral conditions for even factors in graphs},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {387},
pages = {209--214},
doi = {10.1016/j.dam.2026.02.055}
}
EUVIMED