Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Procedia Computer Sc...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Procedia Computer Science
Article . 2019 . Peer-reviewed
License: CC BY NC ND
Data sources: Crossref
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Procedia Computer Science
Article
License: CC BY NC ND
Data sources: UnpayWall
DBLP
Conference object . 2025
Data sources: DBLP
https://dx.doi.org/10.1016/j.p...
Article
Data sources: Microsoft Academic Graph
 View all 2 versions
Claim

Determining Total Vertex Irregularity Strength of T(4, 1) Tadpole Chain Graph and its Computation

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Jan 2019 English Publisher:Elsevier BVJournal:Procedia Computer Science, volume 157, pages 699-706 (issn: 1877-0509, Copyright policy )
Authors: Isnaini Rosyida; Mulyono; Diari Indriati;

doi: 10.1016/j.procs.2019.09.152

Determining Total Vertex Irregularity Strength of T(4, 1) Tadpole Chain Graph and its Computation

Abstract

Abstract In this research, we examine total vertex irregularity strength (tvs) of tadpole chain graph Tr(4,1) with length r. We obtain that tvs (Tr(4, 1))=⌈4r+2/5⌉. Further, we construct algorithm to determine label of vertices, label of edges, weight of vertices, and the exact value of tvs of Tr(4, 1).

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 6
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
6
Average
Top 10%
Top 10%
gold