Abstract |
No non-trivial graph is irregular. So there appears to be little reason to discuss irregular graphs. If the concept of irregularity of graphs is applied to multigraphs then the problem of finding an assignment which gives number of parallel edges between pair of vertices becomes non-trivial and challengeable task. I will discuss different types of irregularity strengths and results related to them.
|