Trees Whose Even-Degree Vertices Induce a Path are Antimagic
An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . ., |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels assigned to edges incident to v. A graph is called antimagic if it has an antimag...
Na minha lista:
| Principais autores: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
University of Zielona Góra
2022-08-01
|
| coleção: | Discussiones Mathematicae Graph Theory |
| Assuntos: | |
| Acesso em linha: | https://doi.org/10.7151/dmgt.2322 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|