On the number of irregular assignments on a graph
From MaRDI portal
Publication:1182886
DOI10.1016/0012-365X(91)90249-2zbMath0743.05045OpenAlexW2023130429MaRDI QIDQ1182886
Joe Hemmeter, Felix Lazebnik, Andrew J. Woldar, Gary L. Ebert
Publication date: 28 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(91)90249-2
Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
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 dense graphs
Cites Work
- The irregularity strength of \(tP_ 3\)
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- Irregular embeddings of hypergraphs with fixed chromatic number
- Highly irregular graphs
- Irregularity strength of dense graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the number of irregular assignments on a graph