Advances and Applications in Discrete Mathematics
Volume 9, Issue 2, Pages 83 - 92
(April 2012)
|
|
IRREGULARITY STRENGTH OF TRIANGULAR SNAKE AND DOUBLE TRIANGULAR SNAKE
M. I. Jinnah and K. R. Santhosh Kumar
|
Abstract: If positive weights are assigned to the edges of a graph G, then degree of a vertex is the sum of the weights of edges that are incident to the vertex. A graph with weighted edges is said to be irregular if the degrees of the vertices are distinct. The irregularity strength of a graph is the smallest s such that the edges can be weighted with and be irregular. This notion is defined in [1]. In this paper, we determine the irregularity strength of triangular snake and double triangular snake. |
Keywords and phrases: irregularity strength, irregular weighting, triangular snake, double triangular snake. |
|
Number of Downloads: 257 | Number of Views: 726 |
|