On prime labellings (Q1322227): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3899969 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3835502 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Another Tree Labelling Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5776927 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4194979 / rank | |||
Normal rank |
Revision as of 15:32, 22 May 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