Computing edge irregularity strength of star and banana trees using algorithmic approach.

DOI10.61091/ARS159-02MaRDI QIDQ6584386zbMATH OpenFDO

Authors Muhammad Imran Shahzad, Muhammad Asim, Roslan Hasni, Ali Ahmad

Publication date 7 August 2024

Published in Ars Combinatoria (Search for Journal in Brave)

Full work available at URL https://doi.org/10.61091/ARS159-02

zbMATH Keywords

banana treescomplete \(m\)-ary tree \(T_{m,h}\)edge irregular labelinggraph algorithmstar

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Computing an edge irregular \(k\)-labeling of star related trees.
• Computing edge irregularity strength of complete m-ary trees
• Computing the edge irregularity strengths of chain graphs and the join of two graphs
• Computing the Edge Irregularity Strength of Bipartite Graphs and Wheel Related Graphs
• Edge irregular k-labeling for several classes of trees

Cited in

(1)

• Computing an edge irregular \(k\)-labeling of star related trees.

This page was built for publication: Computing edge irregularity strength of star and banana trees using algorithmic approach.

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