On the identification of vertices using cycles
type: Item
instance of: scholarly article
title: On the identification of vertices using cycles
zbMATH Open document ID: 1011.05033
author: Petri Rosendahl
published in: The Electronic Journal of Combinatorics
publication date: 2003-05-07T00:00:00Z
full work available at URL: https://eudml.org/doc/122604
full work available at URL: v10i1r7.html
review text: Summary: A set of cycles \(C_1,\dots,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 \(\mathbb{Z}_p^n\) endowed with the Lee or Hamming metric or \(G\) is a complete bipartite graph.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 1907092
zbMATH Keywords: walk
zbMATH Keywords: Hamilton cycle
zbMATH Keywords: Hamming metric
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1907092