Upper bounds on distance vertex irregularity strength of some families of graphs
For a graph \(G\) its distance vertex irregularity strength is the smallest integer \(k\) for which one can find a labeling \(f: V(G)\to \{1, 2, \dots, k\}\) such that \[ \sum_{x\in N(v)}f(x)\neq \sum_{x\in N(u)}f(x)\] for all vertices \(u,v\) of \(G\), where \(N(v)\) is the open neighborhood of \(...
Sábháilte in:
| Príomhchruthaitheoirí: | , , |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
AGH Univeristy of Science and Technology Press
2022-06-01
|
| Sraith: | Opuscula Mathematica |
| Ábhair: | |
| Rochtain ar líne: | https://www.opuscula.agh.edu.pl/vol42/4/art/opuscula_math_4225.pdf |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|