Computing the edge irregularity strength of some classes of grid graphs
From MaRDI portal
Recommendations
- On the edge irregularity strength of grid graphs
- On edge irregularity strength of graphs
- Computing the Edge Irregularity Strength of Bipartite Graphs and Wheel Related Graphs
- On the total edge irregularity strength of certain classes of cycle related graphs
- On the edge irregularity strength of disjoint union of certain graphs.
Cites work
- A new upper bound for the irregularity strength of graphs
- Computing edge irregularity strength of complete m-ary trees
- Computing the Edge Irregularity Strength of Bipartite Graphs and Wheel Related Graphs
- Edge irregular k-labeling for disjoint union of cycles and generalized prisms
- Edge irregular k-labeling for several classes of trees
- Edge Irregular Reflexive Labeling for Some Classes of Plane Graphs
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- scientific article; zbMATH DE number 6769215 (Why is no real title available?)
- Iterative algorithm for computing irregularity strength of complete graph.
- On edge irregularity strength of graphs
- On the edge irregularity strength of corona product of graphs with paths
- On the edge irregularity strength of disjoint union of certain graphs.
- On the edge irregularity strength of grid graphs
- On the irregularity strength of dense graphs
- On the irregularity strength of trees
This page was built for publication: Computing the edge irregularity strength of some classes of grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618045)