By Topic

Addresses for graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

The problem of labeling the vertices of an undirected, connected graph with binary n -tuple addresses is considered. These addresses are to have the property that if two vertices are a distance k apart in the graph then the Hamming distance between the corresponding addresses must be kd where d is a positive integer which is constant for the graph. Not all graphs may be so addressed. A weak characterization of addressable graphs in terms of the eigenvalues of a certain matrix associated with the graph is given. It is shown that any addressable bipartite graph may always be addressed with d = 1 . For nonbipartite addressable graphs, d must be even, and it is shown that there exist graphs requiring an arbitrarily large d for addressing. An addressing algorithm is given which is guaranteed to address any addressable graph.

Published in:

Information Theory, IEEE Transactions on  (Volume:19 ,  Issue: 5 )