On the identification of vertices using cycles (Q1871370): Difference between revisions
From MaRDI portal
Created a new Item |
Import IPFS CIDs |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreih7kuvikmump6pwy5duvbq24aoys26nb7uvixjwqdwgwepog7lh4m / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:34, 22 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the identification of vertices using cycles |
scientific article |
Statements
On the identification of vertices using cycles (English)
0 references
7 May 2003
0 references
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.
0 references
walk
0 references
Hamilton cycle
0 references
Hamming metric
0 references
