a degree condition for the existence of k-factors with prescribed properties
Clicks: 6
ID: 211885
2005
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
1.5
/100
6 views
3 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #329 of 403 articles by views in structural engineering and mechanics
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 403 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Let k be an integer such that k≥3, and let G be a 2-connected graph of order n with n≥4k+1, kn even, and minimum degree at least k+1. We prove that if the maximum degree
of each pair of nonadjacent vertices is at least n/2, then G has a k-factor excluding any given edge. The result of
Nishimura (1992) is improved.
| Reference Key |
wang2005internationala
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Changping Wang |
| Journal | structural engineering and mechanics |
| Year | 2005 |
| DOI |
10.1155/IJMMS.2005.863
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.