The irregularity strength of K_m,m is 4 for odd m
G. Chartrand et al. showed that for odd m, \(m\geq 3\), the edges of \(K_{m,m}\) can be labelled with 1, 2, 3, 4 in such a way that the (weighted) degrees of the vertices are all different. They conjectured that no such labelling exists with labels 1, 2, 3. In this note we prove this conjecture. G. Chartrand et al. showed that for odd m, \(m\geq 3\), the edges of \(K_{m,m}\) can be labelled with 1, 2, 3, 4 in such a way that the (weighted) degrees of the vertices are all different. They conjectured that no such labelling exists with labels 1, 2, 3. In this note we prove this conjecture.
- Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs
- On edge irregular reflexive labellings for the generalized friendship graphs
- Note on edge irregular reflexive labelings of graphs
- Edge irregular reflexive labeling for disjoint union of generalized Petersen graph
- Edge irregular reflexive labeling for the \(r\)-th power of the path
- Distant irregularity strength of graphs
- scientific article; zbMATH DE number 7008834 (Why is no real title available?)
- scientific article; zbMATH DE number 811600 (Why is no real title available?)
- On reflexive edge strength of generalized prism graphs
- On the total irregularity strength of convex polytope graphs
- On the edge irregular reflexive labeling of corona product of graphs with path
- Highly irregular
- 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
- 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
- Face irregular evaluations of family of grids
- On asymptotic confirmation of the Faudree-Lehel conjecture on the irregularity strength of graphs (extended abstract)
- On irregular total labellings
This page was built for publication: The irregularity strength of \(K_{m,m}\) is 4 for odd m
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823264)
