By Topic

Sufficient conditions for realizability of vertex-weighted directed 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)

In this paper we present several sufficient conditions for realizability of terminal capacity matrices of vertex-weighted directed graphs. First necessary and sufficient conditions for a matrix to be realizable by a vertex-weighted directed tree are derived and an algorithm for synthesis is given. Next, as an intermediate step, necessary and sufficient conditions for realizability by a vertex-weighted undirected tree are obtained. These results are then combined to give necessary and sufficient conditions for realizability as a vertex-weighted tree containing both directed and undirected branches. As a corollary, we obtain necessary and sufficient conditions for realizability as a vertex-weighted tree that is a directed path. A simple extension of this result gives realizability conditions for a vertex-weighted directed circuit. Finally we develop necessary and sufficient conditions for realizability as a vertex-weighted graph containing no directed circuits.

Published in:

Circuit Theory, IEEE Transactions on  (Volume:17 ,  Issue: 4 )