on the diameter of dot-critical graphs
Clicks: 138
ID: 183050
2009
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
138 views
9 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #66 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 is \(k\)-dot-critical (totaly \(k\)-dot-critical) if \(G\) is dot-critical (totaly dot-critical) and the domination number is \(k\). In the paper [T. Burtona, D. P. Sumner, Domination dot-critical graphs, Discrete Math, 306 (2006), 11-18] the following question is posed: What are the best bounds for the diameter of a \(k\)-dot-critical graph and a totally \(k\)-dot-critical graph \(G\) with no critical vertices for \(k \geq 4\)? We find the best bound for the diameter of a \(k\)-dot-critical graph, where \(k \in\{4,5,6\}\) and we give a family of \(k\)-dot-critical graphs (with no critical vertices) with sharp diameter \(2k-3\) for even \(k \geq 4\).
| Reference Key |
mojdeh2009opusculaon
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Doost Ali Mojdeh;Somayeh Mirzamani |
| Journal | zhonghua yi xue za zhi |
| Year | 2009 |
| DOI |
http://dx.doi.org/10.7494/OpMath.2009.29.2.165
|
| 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.