Signless Laplacian spectral conditions for even factors in graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917113441026048 |
|---|---|
| author | Li, Lu Liu, Hechao Hua, Hongbo Du, Zenan |
| author_facet | Li, Lu Liu, Hechao Hua, Hongbo Du, Zenan |
| contents | 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 $δ$ contains an even factor based on the signless Laplacian spectral radius. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_00124 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Signless Laplacian spectral conditions for even factors in graphs Li, Lu Liu, Hechao Hua, Hongbo Du, Zenan Combinatorics 05C50, 05C70 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 $δ$ contains an even factor based on the signless Laplacian spectral radius. |
| title | Signless Laplacian spectral conditions for even factors in graphs |
| topic | Combinatorics 05C50, 05C70 |
| url | https://arxiv.org/abs/2512.00124 |