On prime labellings (Q1322227): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q774590 |
||
| Property / reviewed by | |||
| Property / reviewed by: Antonio Andreatta / rank | |||
Revision as of 02:39, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On prime labellings |
scientific article |
Statements
On prime labellings (English)
0 references
1 December 1994
0 references
The paper is devoted to the study of prime graphs, that is finite graphs that admit a prime labelling. A prime labelling of a graph \(G=(V,E)\) is a bijection \(f: V\to \{1,2,\dots,| V|\}\) such that if \(e= \{u,v\}\in E\) then \(\text{GCD}(f(u),f(v))= 1\). Some results concerning bipartite graphs are obtained; all trees of order up to 15 are proved to be prime graphs. Such a result is a partial answer to the conjecture that all trees are prime graphs.
0 references
prime graphs
0 references
prime labelling
0 references
bipartite graphs
0 references
trees
0 references
