IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Journals & Magazines > Circuits and Systems, IEEE Tr ...> Volume:32 Issue:8 Help

On the feasible tree-diameter sets of graphs

Full Text Sign-In or Purchase

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)
Shimizu, T. ; Shibata, Y.

A proof is given for the conjecture on feasible tree-diameter sets of graphs given by Harary et al. [2]. Some additional properties on feasible tree-diameter sets are studied.

Published in:
Circuits and Systems, IEEE Transactions on  (Volume:32 ,  Issue: 8 )

Date of Publication: Aug 1985

Page(s):
862 - 864
ISSN :
0098-4094
Digital Object Identifier :
10.1109/TCS.1985.1085785
Product Type:
Journals & Magazines
Date of Current Version :
06 January 2003
Issue Date :
Aug 1985

IEEE Account

Purchase Details

Profile Information

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.