Search
Now showing items 1-3 of 3
On Total Vertex Irregularity Strength Cocktail Party Graphs
(Jurnal Ilmu Dasar, 2011-01)
A vertex irregular total k-labeling of a graph G is a function λ from both the vertex and the edge sets to {1,2,3,,k} such that for every pair of distinct vertices u and x, λ(u)+ Σλ(uv) ≠ λ(x)+ Σλ(xy). The integer k is ...
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 Existence of Non-Diregular Digraphs of Order Two less than the Moore Bound
(Jurnal Ilmu Dasar, 2011-01)
A communication network can be modelled as a graph or a directed graph, where each processing element is represented by a vertex and the connection between two processing elements is represented by an edge (or, in case of ...