longest cycles in certain bipartite graphs
Clicks: 8
ID: 260537
1998
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
2.1
/100
8 views
1 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #314 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 G be a connected bipartite graph with bipartition (X,Y) such that |X|≥|Y|(≥2),
n=|X| and m=|Y|. Suppose, for all vertices x∈X and y∈Y, dist(x,y)=3 implies
d(x)+d(y)≥n+1. Then G contains a cycle of length 2m. In particular, if m=n, then G is
hamiltomian.
| Reference Key |
wong1998internationallongest
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Pak-Ken Wong |
| Journal | structural engineering and mechanics |
| Year | 1998 |
| DOI |
10.1155/S0161171298000131
|
| 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.