Total Vertex Irregularity Strength of the Disjoint Union of Sun Graphs
Copyright policy )Total Vertex Irregularity Strength of the Disjoint Union of Sun Graphs
A vertex irregular total -labeling of a graph with vertex set and edge set is an assignment of positive integer labels to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of , denoted by is the minimum value of the largest label over all such irregular assignment. In this paper, we consider the total vertex irregularity strengths of disjoint union of isomorphic sun graphs, , disjoint union of consecutive nonisomorphic sun graphs, , and disjoint union of any two nonisomorphic sun graphs .
- University of Jember Indonesia
- Universitas Jember Indonesia
Graph labelling (graceful graphs, bandwidth, etc.), sun graphs, vertex irregular total \(k\) labeling, total vertex irregularity strength
Graph labelling (graceful graphs, bandwidth, etc.), sun graphs, vertex irregular total \(k\) labeling, total vertex irregularity strength
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).2 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).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!