Issue |
RAIRO-Oper. Res.
Volume 59, Number 1, January-February 2025
|
|
---|---|---|
Page(s) | 391 - 396 | |
DOI | https://doi.org/10.1051/ro/2024237 | |
Published online | 04 February 2025 |
Laplacian eigenvalue condition for a graph to have the strong parity property
1
School of Public Management, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu 212100, P.R. China
2
School of Economics and Management, Wenzhou University of Technology, Wenzhou, Zhejiang 325000, P.R. China
* Corresponding author: zw_wzu@163.com
Received:
2
June
2024
Accepted:
28
December
2024
A graph G has the strong parity property if for every subset X ⊆ V (G) with |X| even, G has a spanning subgraph F satisfying δ(F ) ≥ 1, dF (u) ≡ 1 (mod 2) for any u ∈ X, and dF (ν) ≡ 0 (mod 2) for any ν ∈ V (G) ∖ X. Some scholars investigated the strong parity property in graphs and presented some results for graphs to satisfy it. In this paper, we proceed to study the strong parity property in graphs and obtain a Laplacian eigenvalue condition to ensure that a graph satisfy it.
Mathematics Subject Classification: 05C50 / 05C70
Key words: Graph / Laplacian eigenvalue / minimum degree / strong parity factor
© The authors. Published by EDP Sciences, ROADEF, SMAI 2025
This 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.
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.