Irregularity strength of regular graphs of large degree
From MaRDI portal
Publication:685644
DOI10.1016/0012-365X(93)90351-SzbMATH Open0796.05048MaRDI QIDQ685644FDOQ685644
Publication date: 24 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- The irregularity strength of \(K_{m,m}\) is 4 for odd m
- Title not available (Why is that?)
- Irregularity strength of dense graphs
- Irregularity strength of regular graphs of large degree
Cited In (14)
- Distant irregularity strength of graphs
- Irregularity strength of regular graphs of large degree
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
- Irregularity strength of dense graphs
- Equitable irregular edge-weighting of polar grid graph and Mongolian tent graph
- Irregular subgraphs
- The irregularity strength of \(K_{m,m}\) is 4 for odd m
- Irregularity strength of regular graphs
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- A generalization of Faudree–Lehel conjecture holds almost surely for random graphs
- The characterization of large order \((3, r)\)-regular graphs
- Total edge irregularity strength of large graphs
- On the irregularity strength of trees
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)
