Computing edge irregularity strength of complete m-ary trees using algorithmic approach

Abstract:

Algorithms help in solving many problems, where other mathematical solutions are very complex or impossible. Computations help in tackling numerous issues, where other numerical arrangements are extremely perplexing or incomprehensible. In this paper, the edge irregularity strength of a complete binary tree (T2,h), complete ternary tree (T3,h) and generalized for complete m-ary tree are computed using the algorithmic approach.

Año de publicación:

2018

Keywords:

• Edge irregularity strength
• ALGORITHMS
• Complete m-ary tree T m,h

Fuente:

scopus