Minimal Graphs with a Specified Code Map Image
Let $G$ be a graph and $e_1,\cdots ,e_n$ be $n$ distinct vertices. Let $\rho$ be the metric on $G$. The code map on vertices, corresponding to this list, is $c(x)=(\rho (x,e_1),\cdots ,\rho (x,e_n))$. This paper introduces a variation: begin with $V\subseteq\bbz^n$ for some $n$, and consider assignm...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2018-08-01
|
| Series: | Theory and Applications of Graphs |
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol5/iss2/4 |