Neighbor Full Sum Distinguishing Total Coloring of Planar Graphs with Girth at Least 5
A neighbor full sum distinguishing total coloring of a graph <i>G</i> is a proper <i>k</i>-total coloring <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>ϕ</mi></semantics></math></inline-formula> such that no two adjacent vertices <i>u</i> and <i>v</...
Gardado en:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
MDPI AG
2025-06-01
|
| Series: | Axioms |
| Assuntos: | |
| Acceso en liña: | https://www.mdpi.com/2075-1680/14/7/496 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|