general vertex-distinguishing total coloring of graphs
Clicks: 83
ID: 254788
2014
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
Emerging Content
24.6
/100
83 views
20 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #236 of 357 articles by views in Chemico-biological interactions
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 357 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
The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for which the vertices and edges of G are colored using k colors such that any two vertices have distinct sets of colors of them and their incident edges. In this paper, we figure out the exact value of this chromatic number of some special graphs and propose a conjecture on the upper bound of this chromatic number.
| Reference Key |
liu2014journalgeneral
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Chanjuan Liu;Enqiang Zhu |
| Journal | Chemico-biological interactions |
| Year | 2014 |
| DOI |
10.1155/2014/849748
|
| 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.