Irregularity strength of regular graphs of large degree
From MaRDI portal
It is proved that if \(G\) is an \(n-3\) or \(n-4\) regular graph of order \(n\) (except for \(G=K_{3,3})\), then the irregularity strength of \(G\) is 3, where the irregularity strength of a graph \(G\) is the smallest possible value of \(k\) for which we can assign positive integers less than or equal to \(k\) such that the sums at each vertex are distinct. It is also conjectured that if \(r \geq n/2\), then any \(r\)-regular graph has irregularity strength 3 except for complete bipartite graphs \(K_{t,t}\) with \(t\) odd.
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
(21)- Irregularity strength of regular graphs
- The irregularity strength of \(K_{m,m}\) is 4 for odd m
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- The characterization of large order (3, r)-regular graphs
- Distant irregularity strength of graphs
- On the irregularity strength of trees
- scientific article; zbMATH DE number 867641 (Why is no real title available?)
- Algorithm for computing the total vertex irregularity strength of some cubic graphs
- Irregular subgraphs
- Irregularity strength of dense graphs
- A generalization of Faudree–Lehel conjecture holds almost surely for random graphs
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
- Modular irregularity strength of dense graphs
- Total edge irregularity strength of large graphs
- Equitable irregular edge-weighting of polar grid graph and Mongolian tent graph
- Irregularity strength of regular graphs of large degree
- The irregularity strength of dense graphs -- on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel
- Finding irregular subgraphs via local adjustments
- The 1-2-3 conjecture holds for graphs with large enough minimum degree
- On asymptotic confirmation of the Faudree-Lehel conjecture on the irregularity strength of graphs (extended abstract)
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)
