Modular irregularity strength of graphs
From MaRDI portal
Publication:4958009
Recommendations
Cites work
- scientific article; zbMATH DE number 4142086 (Why is no real title available?)
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A Tight Bound on the Irregularity Strength of Graphs
- A new upper bound for the irregularity strength of graphs
- Irregular Assignments of Trees and Forests
- Irregular labelings of circulant graphs
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- Irregularity strength of regular graphs
- Irregularity strength of trees
- No Graph is Perfect
- On graph irregularity strength
- On the irregularity strength of dense graphs
- On the irregularity strength of trees
Cited in
(7)- Modular irregularity strength of dense graphs
- Modularity of regular and treelike graphs
- Modular irregular labeling of some new classes of graphs
- On H-irregularity strength of graphs
- Modular irregularity strength of the corona product of graphs
- Modular irregularity strength on some flower graphs
- Edge and modular edge irregularity strength of some path related graphs
This page was built for publication: Modular irregularity strength of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958009)