The total edge irregularity strength of hexagonal grid graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1614340 (Why is no real title available?)
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- scientific article; zbMATH DE number 867641 (Why is no real title available?)
- scientific article; zbMATH DE number 6769215 (Why is no real title available?)
- A Tight Bound on the Irregularity Strength of Graphs
- A dynamic survey of graph labeling
- Irregular Assignments of Trees and Forests
- Irregular total labellings of generalized Petersen graphs
- Irregularity strength of trees
- On irregular total labellings
- On magic labelings of honeycomb
- On the irregularity strength of trees
- On the total edge irregularity strength of hexagonal grid graphs
- On the total edge irregularity strength of zigzag graphs
- Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
- Total edge irregularity strength of complete graphs and complete bipartite graphs
- Total edge irregularity strength of generalized prism
- Total edge irregularity strength of ladder-related graphs
- Total edge irregularity strength of trees
This page was built for publication: The total edge irregularity strength of hexagonal grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6973353)