Group irregular labelings of disconnected graphs
From MaRDI portal
Publication:4598375
Abstract: We investigate the extit{group irregularity strength} () of graphs, i.e. the smallest value of such that taking any Abelian group of order , there exists a function such that the sums of edge labels at every vertex are distinct. We give the exact values and bounds on for chosen families of disconnected graphs. In addition we present some results for the extit{modular edge gracefulness} , i.e. the smallest value of such that there exists a function such that the sums of edge labels at every vertex are distinct.
Recommendations
- Note on group irregularity strength of disconnected graphs
- Group irregularity strength of connected graphs
- Note on the group edge irregularity strength of graphs
- Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs
- 1-distant irregularity strength of graphs
Cited in
(8)- scientific article; zbMATH DE number 7637429 (Why is no real title available?)
- Zero sum partition of abelian groups into sets of the same order and its applications
- Modular irregularity strength on some flower graphs
- Group irregularity strength of connected graphs
- Realization of digraphs in Abelian groups and its consequences
- Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs
- Note on group irregularity strength of disconnected graphs
- scientific article; zbMATH DE number 4128837 (Why is no real title available?)
This page was built for publication: Group irregular labelings of disconnected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598375)