On the total irregularity strength of convex polytope graphs

DOI10.22199/issn.0717-6279-3959zbMath1482.05288OpenAlexW3176734009MaRDI QIDQ5063438

Usman Ali, Syed Ahtsham ul Haq Bokhary, Muhammad Imran

Publication date: 21 March 2022

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22199/issn.0717-6279-3959

zbMATH Keywords

convex polytopesirregular assignmentirregularity strengthvertex irregular total \(k\)-labeling

Mathematics Subject Classification ID

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

Cites Work

• On families of convex polytopes with constant metric dimension
• On irregular total labellings
• The irregularity strength of \(K_{m,m}\) is 4 for odd m
• Irregular networks, regular graphs and integer matrices with distinct row and column sums
• The irregularity strength and cost of the union of cliques
• Numbered complete graphs, unusual rulers, and assorted applications
• On the irregularity strength of trees
• A Tight Bound on the Irregularity Strength of Graphs
• On graph irregularity strength
• Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the total irregularity strength of convex polytope graphs