Cart (Loading....) | Create Account
Close category search window

On (d, k, μ) 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

1 Author(s)

A (d, k, μ graph is defined as a graph in which every vertex has degree at most d, and every pair of vertices are joined by μ edge-disjoint paths, each of length at most k. The order of a graph is the number of vertices it contains. N(d, k, μ) is the number that is the largest of all the orders of ( d, k, μ) graphs. Elspas has investigated , k, pμ graphs when k= 2 and when k = .μ In this paper, (d, k, μ) graphs for d = μ are constructed, yielding lower bounds on N(d, k, d). Further, for d= k = μ = 3, N( d, k, μ) is determined and the graphs attaining this order are characterized. ( d, k, μ) graphs are potentially useful in determining how propagation delay, terminal packing factors, and possible blocking conditions may constrain a modeled digital system.

Published in:

Computers, IEEE Transactions on  (Volume:C-18 ,  Issue: 3 )

Date of Publication:

March 1969

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.