On the identification of vertices using cycles (Q1871370): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:00, 5 March 2024

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
    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

    Identifiers