Referenced Items are not available for this document.
A graph-classification concept is introduced, which extends the notion of dense, medium, and sparse graphs and makes the classification a function of a preassigned real nonnegative number. Important properties of various classes of graphs are discussed. An algorithm for the harmonious decomposition of a graph is proposed that yields a minimum basic set of the graph and determines the available range of the real nonnegative number. Harmonious decomposition is considered in connection with the hybrid method of network analysis.<
Published in:
Circuits and Systems, 1988., IEEE International Symposium on
Date of Conference: 7-9 June 1988
- Page(s):
- 1317 - 1320 vol.2
- Meeting Date :
- 07 Jun 1988-09 Jun 1988
- INSPEC Accession Number:
- 3338161
- Conference Location :
- Espoo, Finland
- Digital Object Identifier :
- 10.1109/ISCAS.1988.15170
- Product Type:
- Conference Publications
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.
