Irregularity strength of regular graphs of large degree
From MaRDI portal
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?)
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- Irregularity strength of dense graphs
- Irregularity strength of regular graphs of large degree
- The irregularity strength of \(K_{m,m}\) is 4 for odd m
Cited in
(16)- Distant irregularity strength of graphs
- Irregularity strength of regular graphs
- Irregularity strength of regular graphs of large degree
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- Irregular subgraphs
- Irregularity strength of dense graphs
- Modular irregularity strength of dense graphs
- On the irregularity strength of trees
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- Total edge irregularity strength of large graphs
- The irregularity strength of \(K_{m,m}\) is 4 for odd m
- A generalization of Faudree–Lehel conjecture holds almost surely for random graphs
- Algorithm for computing the total vertex irregularity strength of some cubic graphs
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
- The characterization of large order \((3, r)\)-regular graphs
- Equitable irregular edge-weighting of polar grid graph and Mongolian tent graph
This page was built for publication: Irregularity strength of regular graphs of large degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685644)
