论文信息 - On irregular total labellings

On irregular total labellings

Two new graph characteristics, the total vertex irregularity strength and the total edge irregularity strength, are introduced. Estimations on these parameters are obtained. For some families of graphs the precise values of these parameters are proved.

[1] Tom Bohman,et al. On the irregularity strength of trees , 2004, J. Graph Theory.

[2] Richard H. Schelp,et al. Irregular networks, regular graphs and integer matrices with distinct row and column sums , 1989, Discret. Math..

[3] András Gyárfás. The irregularity strength of Km, m is 4 for odd m , 1988, Discret. Math..

[4] Till Nierhoff. A Tight Bound on the Irregularity Strength of Graphs , 2000, SIAM J. Discret. Math..

[5] S. M. Hegde,et al. On magic graphs , 2003, Australas. J Comb..

[6] David K. Garnick,et al. On the irregularity strength of the m × n grid , 1992, J. Graph Theory.

[7] W. Wallis,et al. Magic Graphs , 2001 .

[8] Stanislav Jendrol',et al. The irregularity strength and cost of the union of cliques , 1996, Discret. Math..