Group Irregularity Strength of Connected GraphsReport as inadecuate



 Group Irregularity Strength of Connected Graphs


Group Irregularity Strength of Connected Graphs - Download this document for free, or read online. Document in PDF available to download.

Download or read this book online for free in PDF: Group Irregularity Strength of Connected Graphs
We investigate the group irregularity strength ($s g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G) ightarrow \gr$ such that the sums of edge labels at every vertex are distinct. We prove that for any connected graph $G$ of order at least 3, $s g(G)=n$ if $n eq 4k+2$ and $s g(G)\leq n+1$ otherwise, except the case of some infinite family of stars.



Author: Marcin Anholcer; Sylwia Cichacz; Martin Milanic

Source: https://archive.org/







Related documents