On labelling complete tripartite graphs (Q4359650)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1076220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On labelling complete tripartite graphs |
scientific article; zbMATH DE number 1076220 |
Statements
On labelling complete tripartite graphs (English)
0 references
14 December 1997
0 references
graceful
0 references
harmonious
0 references
complete tripartite graphs
0 references
0.8425247073173523
0 references
0.8356307148933411
0 references
0.8278228044509888
0 references
0.8182876110076904
0 references
A graph \(G=(V, E)\) is graceful if there is a function \(f:V\to \{0,1,\dots,|E|\}\), such that each edge \(\{v,w\}\in E\) gets a different value for \(|f(v)-f(w)|\) from the set \(\{1,\dots,|E|\}\). A graph \(G= (V,E)\) is harmonious, if there is an injection \(f:V\to\text{Z}_m\) such that the function \(f^*:E\to\text{Z}_m\), defined by \(f(\{v,w\})= f(v)+ f(w)\) (for all \(\{v,w\}\in E\)) is an injection. This paper shows for several complete tripartite or related graphs that they are graceful or harmonious: \(K_{1,n,p}\) and \(K_{2,2,p}\) are harmonious for every positive integer \(p\), \(K_{1,1,p,q}\) is graceful and harmonious, and \(B(3,2,m)\) and \(B(4,3,m)\) are harmonious, where \(B(n,r,m)\) is the graph consisting of \(m\) copies of \(K_n\) with \(K_r\) in common. The authors give examples of complete tripartite graphs that are not harmonious, and they conjecture that all complete tripartite graphs are graceful.
0 references