On inclusive d-distance irregularity strength on triangular ladder graph and path
The length of a shortest path between two vertices u and v in a simple and connected graph G, denoted by d(u, v), is called the distance of u and v. An inclusive vertex irregular d-distance labeling is a labeling defined as such that the vertex weight, that is are all distinct. The minimal value of...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Taylor & Francis Group
2020-09-01
|
| coleção: | AKCE International Journal of Graphs and Combinatorics |
| Assuntos: | |
| Acesso em linha: | http://dx.doi.org/10.1016/j.akcej.2019.10.003 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|