Can I read Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs on EtoBox?

Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs by Stanislav Jendrol'; Jozef Miškuf; Roman Soták is a Computer Science article available to read on EtoBox.

What is Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs about?

A total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges of G with labels from the set {1, ..., k} in such a way that for any two different edges e and f their weights φ(f ) and φ(e) are distinct where the weight of an edge g = uv is φ(g) = ν(e) + ν(u) + ν(v), i. e. the sum of the label of g and the labels of vertices u and v. The minimum k for which the graph G has an edge irregular total k-labelling is called the total edge irregularity strength of G. We show the exact value of the total edge irregularity strength of complete graphs and complete bipartite graphs.

Who reads Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs?

Author

Stanislav Jendrol'; Jozef Miškuf; Roman Soták

Publisher

Elsevier Science; Elsevier ; Elsevier BV; Amsterdam: Elsevier BV (ISSN 1571-0653)

Published

2007

Language

EN

Field

Computer Science (Physical Sciences)