Prime Distance Graphs and Applications of Graph Labeling: A Modelling Approach
A diagram H is a prime distance graph if there is a one-to-one function h: V (H) Z such that the number |h(x) h(y)| is...
A diagram H is a prime distance graph if there is a one-to-one function h: V (H) Z such that the number |h(x) h(y)| is...