On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture
This paper is dedicated to studying the following question: Is it always possible to injectively assign the weights 1, ..., |E(G)| to the edges of any given graph G (with no component isomorphic to K2) so that every two adjacent vertices of G get distinguished by their sums of incident weights? One...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Discrete Mathematics & Theoretical Computer Science
2017-08-01
|
| シリーズ: | Discrete Mathematics & Theoretical Computer Science |
| 主題: | |
| オンライン･アクセス: | https://dmtcs.episciences.org/2168/pdf |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|