The Irregularity Strength of a Graph
Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)
- 552 Downloads
Throughout Chaps. 2–7, we will be concerned with connected graphs G of order n ≥ 3 and size m and an unrestricted edge coloring of G, that is, no condition is placed on the manner in which colors are assigned to the edges of G.
KeywordsIrregularity Strength Vertex-distinguishing Edge Coloring Regular Graphs Large Color Unicyclic Graphs
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- 27.Dirac, G. A. (1952). Some theorems on abstract graphs. Proceedings of the London Mathematical Society, 2, 69–81.Google Scholar
- 38.Faudree, R. J., & Lehel, J. (1987). Bound on the irregularity strength of regular graphs. In Combinatorics. Colloq. Math. Soc. János Bolyai (Vol. 52, pp. 247–256). Amsterdam: North Holland.Google Scholar
- 39.Faudree, R. J., Gyárfás, A., & Schelp, R. H. (1987). On graphs of irregularity strength 2. In Combinatorics. Colloq. Math. Soc. János Bolyai (Vol. 52, pp. 239–246). Amsterdam: North Holland.Google Scholar
© Ping Zhang 2015