Search
Now showing items 1-2 of 2
Total vertex irregularity strength of wheel related graphs
(Australasian Journal of Combinatorics, 2011)
For a simple graph G with vertex set V (G) and edge set E(G), a labeling φ : V (G) ∪ E(G) → {1, 2, . . . , k} is called a vertex irregular total klabeling of G if for any two different vertices x and y, their weights wt(x) ...
On the partition dimension and connected partition dimension of wheels
(Ars Combinatoria, 2007)