Computing edge irregularity strength of complete m-ary trees

MaRDI QIDQ5380117zbMATH OpenFDO

Authors

Publication date 3 June 2019

zbMATH Keywords

algorithmscomplete $m$-ary tree $T_{m,h}$edge irregularity strength

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Iterative algorithm for computing irregularity strength of complete graph.
• Computing the edge irregularity strengths of chain graphs and the join of two graphs
• An iterative approach to graph irregularity strength
• Algorithm for computing the total vertex irregularity strength of some cubic graphs
• scientific article; zbMATH DE number 3898919

Cited in

(5)

• On the edge irregularity strength for some classes of plane graphs
• Iterative algorithm for computing irregularity strength of complete graph.
• Computing edge irregularity strength of star and banana trees using algorithmic approach.
• Computing the edge irregularity strength of some classes of grid graphs
• On the total vertex irregularity strength of trees

This page was built for publication: Computing edge irregularity strength of complete $m$-ary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380117)