on some families of arbitrarily vertex decomposable spiders
Clicks: 101
ID: 136871
2010
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
30.0
/100
101 views
9 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #81 of 95 articles by views in zhonghua yi xue za zhi
Most read
Least read
Bar heights use a square-root scale.
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
A graph \(G\) of order \(n\) is called arbitrarily vertex decomposable if for each sequence \((n_1, ..., n_k)\) of positive integers such that \(\sum _{i=1}^{k} n_i = n\), there exists a partition \((V_1, ..., V_k)\) of the vertex set of \(G\) such that for every \(i \in \{1, ...., k\}\) the set \(V_i\) induces a connected subgraph of \(G\) on \(n_i\) vertices. A spider is a tree with one vertex of degree at least \(3\). We characterize two families of arbitrarily vertex decomposable spiders which are homeomorphic to stars with at most four hanging edges.
| Reference Key |
juszczyk2010opusculaon
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Tomasz Juszczyk;Irmina A. Zioło |
| Journal | zhonghua yi xue za zhi |
| Year | 2010 |
| DOI |
http://dx.doi.org/10.7494/OpMath.2010.30.2.147
|
| URL | |
| Keywords | Keywords not found |
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.