equitable coloring of graph products
Clicks: 159
ID: 151138
2006
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
Popular Article
30.0
/100
159 views
17 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #53 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 is equitably \(k\)-colorable if its vertices can be partitioned into \(k\) independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest \(k\) for which such a coloring exists is known as the equitable chromatic number of \(G\) and denoted by \(\chi_{=}(G)\). It is interesting to note that if a graph \(G\) is equitably \(k\)-colorable, it does not imply that it is equitably \((k+1)\)-colorable. The smallest integer \(k\) for which \(G\) is equitably \(k'\)-colorable for all \(k'\geq k\) is called the equitable chromatic threshold of \(G\) and denoted by \(\chi_{=}^{*}(G)\). In the paper we establish the equitable chromatic number and the equitable chromatic threshold for certain products of some highly-structured graphs. We extend the results from [Chen B.-L., Lih K.-W., Yan J.-H., Equitable coloring of graph products, manuscript, 1998] for Cartesian, weak and strong tensor products.
| Reference Key |
furmaczyk2006opusculaequitable
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Hanna Furmańczyk |
| Journal | zhonghua yi xue za zhi |
| Year | 2006 |
| DOI |
DOI not found
|
| 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.