ON PRIME LABELINGS

Full metadata record

DC Field	Value	Language
dc.contributor.author	FU, HL	en_US
dc.contributor.author	HUANG, KC	en_US
dc.date.accessioned	2014-12-08T15:04:05Z	-
dc.date.available	2014-12-08T15:04:05Z	-
dc.date.issued	1994-03-15	en_US
dc.identifier.issn	0012-365X	en_US
dc.identifier.uri	http://hdl.handle.net/11536/2580	-
dc.description.abstract	Let G = (V, E) be a graph. A bijection f:V--> {1, 2,...,V} is called a prime labelling if for each e = {u, v} in E, we have GCD(f(u),f(v)) = 1. A graph admits a prime labelling is called a prime graph. Around ten years ago, Roger Entringer conjectured that every tree is prime. So far, this conjecture is still unsolved. In this paper, we show that the conjecture is true for trees of order up to 15, and also show that a few other classes of graphs are prime.	en_US
dc.language.iso	en_US	en_US
dc.title	ON PRIME LABELINGS	en_US
dc.type	Article	en_US
dc.identifier.journal	DISCRETE MATHEMATICS	en_US
dc.citation.volume	127	en_US
dc.citation.issue	1-3	en_US
dc.citation.spage	181	en_US
dc.citation.epage	186	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:A1994NG61900017	-
dc.citation.woscount	7	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.