Algorithm for computing the total vertex irregularity strength of some cubic graphs

MaRDI QIDQ4959504zbMATH OpenFDO

Authors Rikayanti, E. T. Baskoro

Publication date 13 September 2021

Full work available at URL http://ijmcs.future-in-tech.net/16.3/R-Rikayanti-Baskoro.pdf

zbMATH Keywords

algorithmcubic graphtotal vertex irregularity strength

Mathematics Subject Classification ID

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

Recommendations

• Vertex irregular total labeling of cubic graphs
• Total irregularity strength of some cubic graphs
• Computing an irregularity strength of selected graphs
• Iterative algorithm for computing irregularity strength of complete graph.
• Irregularity strength of regular graphs of large degree

Cited in

(3)

• Iterative algorithm for computing irregularity strength of complete graph.
• Computing edge irregularity strength of complete m-ary trees
• The total vertex irregularity strength for cubic graphs with a perfect matching

This page was built for publication: Algorithm for computing the total vertex irregularity strength of some cubic graphs

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