GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS
A graph \(G(V,E)\) is a system consisting of a finite non empty set of vertices \(V(G)\) and a set of edges \(E(G)\). A (proper) vertex colouring of \(G\) is a function \(f:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\) such that \(f(u)\neq f(v)\) for every edge \(uv\in E(G)\)....
Tallennettuna:
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin, Krasovskii Institute of Mathematics and Mechanics
2023-12-01
|
| Sarja: | Ural Mathematical Journal |
| Aiheet: | |
| Linkit: | https://umjuran.ru/index.php/umj/article/view/600 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|