期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2016
卷号：13
期号：2
页码：165-176
DOI：10.1016/j.akcej.2016.04.001
语种：English
出版社：Elsevier
摘要：AbstractA graph onnvertices is said to admit a prime labeling if we can label its vertices with the firstnnatural numbers such that any two adjacent vertices have relatively prime labels. Here we extend the idea of prime labeling to the Gaussian integers, which are the complex numbers whose real and imaginary parts are both integers. We begin by defining an order on the Gaussian integers that lie in the first quadrant. Using this ordering, we show that several families of trees admit a prime labeling with the Gaussian integers.
关键词：KeywordsenPrime labeling of treesGaussian integersEntringer’s conjecture
