on the total vertex irregularity strength of comb product of two cycles and two stars
Clicks: 183
ID: 138948
2020
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
Star Article
30.0
/100
183 views
36 readers
AI Quality Assessment
Not analyzed
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 = (V(G),E(G)) be a graph and k be a positive integer. A total k-labeling of G is a map f : V ∪ E → {1,2,3,...,k}. The vertex weight v under the labeling f is denoted by w_f(v) and defined by w_f(v) = f(v) + \sum_{uv \in{E(G)}} {f(uv)}. A total k-labeling of G is called vertex irregular if there are no two vertices with the same weight. The total vertex irregularity strength of G, denoted by tvs(G), is the minimum k such that G has a vertex irregular total k-labeling. This labelings were introduced by Baca, Jendrol, Miller, and Ryan in 2007. Let G and H be two connected graphs. Let o be a vertex of H. The comb product between G and H, denoted by G \rhd_o H, is a graph obtained by taking one copy of G and |V(G)| copies of H and grafting the i-th copy of H at the vertex o to the i-th vertex of G. In this paper, we determine the total vertex irregularity strength of comb product of two cycles and two stars.
| Reference Key |
ramdani2020indonesianon
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Rismawati Ramdani |
| Journal | indonesian journal of combinatorics |
| Year | 2020 |
| DOI |
10.19184/ijc.2019.3.2.2
|
| 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.