Iterative algorithm for computing irregularity strength of complete graph.

MaRDI QIDQ4684486zbMATH OpenFDO

Authors

Publication date 1 October 2018

zbMATH Keywords

computational complexitydecrease and conquergraph algorithmsirregular assignmentirregularity strength

Mathematics Subject Classification ID

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

Recommendations

• Computing edge irregularity strength of complete m-ary trees
• An iterative approach to graph irregularity strength
• scientific article; zbMATH DE number 22657
• Computing the edge irregularity strengths of chain graphs and the join of two graphs
• Algorithm for computing the total vertex irregularity strength of some cubic graphs

Cited in

(4)

• On the edge irregularity strength for some classes of plane graphs
• Algorithm for computing the total vertex irregularity strength of some cubic graphs
• Computing edge irregularity strength of complete m-ary trees
• Computing the edge irregularity strength of some classes of grid graphs

This page was built for publication: Iterative algorithm for computing irregularity strength of complete graph.

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