HIGHLIGHTS
- who: Mathematics Subject Classification and collaborators from the Institut Teknologi Bandung, Bandung, Indonesia have published the paper: Further results on local inclusive distance ver- tex irregularity strength of graphs, in the Journal: (JOURNAL)
- what: In the following theorem, the authors provide the strength when the bipartite graph G is regular.
SUMMARY
The least number k satisfying the condition above is called irregularity strength of G. Some results regarding to irregularity strength of graphs may be seen. The minimum integer k satisfying such labeling f is called distance vertex irregularity strength of . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.