Geodesic
On the identification of vertices using cycles
The electronic journal of combinatorics, Tome 10 (2003)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A set of cycles $C_1,\ldots ,C_k$ in a graph $G$ is said to identify the vertices $v$ if the sets $\{j:v\in C_j\}$ are all nonempty and different. In this paper, bounds for the minimum possible $k$ are given when $G$ is the graph ${\bf Z}_p^n$ endowed with the Lee or Hamming metric or $G$ is a complete bipartite graph.
DOI : 10.37236/1700
Classification : 05C38, 94C15
Mots-clés : walk, Hamilton cycle, Hamming metric 
@article{10_37236_1700,
     author = {Petri Rosendahl},
     title = {On the identification of vertices using cycles},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1700},
     zbl = {1011.05033},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1700/}
}
TY  - JOUR
AU  - Petri Rosendahl
TI  - On the identification of vertices using cycles
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1700/
DO  - 10.37236/1700
ID  - 10_37236_1700
ER  - 
%0 Journal Article
%A Petri Rosendahl
%T On the identification of vertices using cycles
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1700/
%R 10.37236/1700
%F 10_37236_1700
Petri Rosendahl. On the identification of vertices using cycles. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1700

Cité par Sources :