The irregularity strength of \(K_{m,m}\) is 4 for odd m

DOI10.1016/0012-365X(88)90106-9zbMath0681.05066OpenAlexW2075796525MaRDI QIDQ1823264

Yanyan Li

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90106-9

zbMATH Keywords

edge-labelling

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items

Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs, On reflexive edge strength of generalized prism graphs, On the total irregularity strength of convex polytope graphs, On edge irregular reflexive labellings for the generalized friendship graphs, On irregular total labellings, Edge irregular reflexive labeling for the \(r\)-th power of the path, Distant irregularity strength of 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, Irregularity strength of regular graphs of large degree, On the edge irregular reflexive labeling of corona product of graphs with path, Irregularity strength of dense graphs, Note on edge irregular reflexive labelings of graphs, Unnamed Item, Unnamed Item, Highly Irregular, Edge irregular reflexive labeling for disjoint union of generalized Petersen graph

Cites Work

• Irregular networks, regular graphs and integer matrices with distinct row and column sums