• Corpus ID: 125443735

Prime Labeling of Small Trees with Gaussian Integers

  title={Prime Labeling of Small Trees with Gaussian Integers},
  author={Hunter Lehmann and Andrew Park},
  journal={Rose–Hulman Undergraduate Mathematics Journal},
A graph on n vertices is said to admit a prime labeling if we can label its vertices with the first n natural 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 all trees of order at most 72 admit a prime… 

Figures and Tables from this paper

Gaussian Neighborhood-prime Labeling of Graphs Containing Hamiltonian Cycle
In this paper, we examine Gaussian neighborhood-prime labeling of generalized Peterson graph and graphs which contain Hamiltonian cycle.
Weight Distributions, Automorphisms, and Isometries of Cyclic Orbit Codes
This dissertation investigates the structure of the weight distribution for cyclic orbit codes and shows that for full-length orbit codes with maximal possible distance the weight Distribution depends only on q, n, and the dimension of U .


A Dynamic Survey of Graph Labeling
In this survey I have collected everything I could find on graph labelings techniques that have appeared in journals that are not widely available.
On Newman's Conjecture and Prime Trees
Abstract In 1980, Carl Pomerance and J. L. Selfridge proved D. J. Newman's coprime mapping conjecture: If n is a positive integer and I is a set of n consecutive integers, then there is a bijection ƒ
Elementary Number Theory And Its Applications
The elementary number theory and its applications is universally compatible with any devices to read and is available in the book collection an online access to it is set as public so you can get it instantly.
Every tree with at most 34 vertices is prime
  • Util. Math.,
  • 2002
Introduction to graph theory
∪ {γ 64 , γ 65 } γ 59 = 8 + 5i {γ 58 , γ 64 , γ 65 } = {8 + 6i, 8, 9} 3i {γ 62 , γ 65 , γ 66 } = {8 + 2i
    ∪ {γ 63 , γ 64 } γ 57 = 8 + 7i {γ 56
      γ 65 } γ 59 = 8 + 5i {γ 60 , γ 62 , γ 63 } = {8 + 4i, 8 + 2i, 8 + i} [γ 58 ] ∪ {γ 64 , γ 65 } 60
        ∪ {γ 63 , γ 64 } γ 59 = 8 + 5i {γ 60