BROWSE

Related Scientist

's photo.

수리및계산과학연구단
more info

ITEM VIEW & DOWNLOAD

Eigenvalues and parity factors in graphs with given minimum degree

Cited 0 time in webofscience Cited 0 time in scopus
215 Viewed 0 Downloaded
Title
Eigenvalues and parity factors in graphs with given minimum degree
Author(s)
Donggyu Kim; O, Suil
Publication Date
2023-04
Journal
Discrete Mathematics, v.346, no.4
Publisher
Elsevier BV
Abstract
© 2022 Elsevier B.V.Let G be a graph and let g,f be nonnegative integer-valued functions defined on V(G) such that g(v)≤f(v) and g(v)≡f(v)(mod2) for all v∈V(G). A (g,f)-parity factor of G is a spanning subgraph H such that for each vertex v∈V(G), g(v)≤dH(v)≤f(v) and f(v)≡dH(v)(mod2). We prove sharp upper bounds for certain eigenvalues in an h-edge-connected graph G with given minimum degree to guarantee the existence of a (g,f)-parity factor.
URI
https://pr.ibs.re.kr/handle/8788114/13218
DOI
10.1016/j.disc.2022.113290
ISSN
0012-365X
Appears in Collections:
Pioneer Research Center for Mathematical and Computational Sciences(수리 및 계산과학 연구단) > 1. Journal Papers (저널논문)
Files in This Item:
There are no files associated with this item.

qrcode

  • facebook

    twitter

  • Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
해당 아이템을 이메일로 공유하기 원하시면 인증을 거치시기 바랍니다.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse