Journal of Microwave Engineering and Technologies
Network Analysis and Synthesis Through Graph Theory as a Tool
Abstract
AbstractAs time went on, the systems to be dealt with increased enormously in size and complexity. Simultaneously, there has been an evolution in combinatory and graph theory, which led to producing a number of highly efficient graph theoretic algorithms devised with an eye on economy in time and computer storage requirements. Because of space limitations the current review cannot deal with the whole spectrum of relevant topics and will try to cover only the problems of network analysis and synthesis.Keywords: Dioptics, GE (Gaussian elimination), network theoryCite this ArticleRicha Agarwal, Rakhi Trivedi. Network Analysis and Synthesis Through Graph Theory as a Tool. Journal of Microwave Engineering & Technologies. 2019; 6(3): 11–17p.References (18)
- A Bers. The degrees of freedom RLC networks. IRE Transactions on Circuit Theory. Mar. 1959;6(3):91–95.
- G Biorci PP Civaheri Conditions for the reliability of conductance matrix,”IRE Trans. Circuit Theo ry. Sept. 1961 ;9(3): 312–318.
- PR Bryant . Order of complexity of electrical networks . Proceedings of the IEE—Part C: Monographs . June 1959;106(10):174–188.
- S. Chan , HN Mai . A flow -graph method for the analysis of linear systems . IEEE Trans. Circuit Theory . 1967;14(3):350–
- 5. Martin Golumbic, Clint Goss . Perfect Elimination and Chordal Bipartite Graphs. Journal of Graph Theory . 2006;2(2):155–
- 6. S Seshu , MB Reed . Linear Graphs and Electrical Networks. Reading, MA: Addison-Wesley, 1961.
- Veblen. Analysis Situs. Amer. Math. Sot. CON. Lectures, 1916, New York, 1922.
- Sangiovanm-Vincentelh, Th A Bickart . Bipartite graphs and an optimal bordered triangular form of a matrix . IEEE Trans. Circuits Syst. Oct. 1979;26(10):880–889.
- LO Chua, LK Chen. On optimally sparse cycle and coboundary basis for a linear graph. IEEE Trans. Circuit Theory . Sept. 1973;20(5):495–504.
- Tatsuo Ohtsuki, Hajimu m Mori, Toshinobu Kashiwabara, Toshio Fujisawa. On minimal augmentation of a graph to obtain an interval graph . Journal of Computer and System Sciences . 1981;22(1): 60–97p.
- L Haskins, DJ Rose . Toward characterization of perfect elimination digraphs. SIAM J. Comp. 1973;2(4):217–
- 12. LK Cheung, ES Kuh. The b ordered triangular matrix and minimum essential sets of a digraph . IEEE Trans. Circuits Syst. Sept. 1974;21(5):633–640.
- L Dulmage , NS Mendelsohn. On the inversion of sparse matrices. Maths. Computation. 1962;16:494–496.
- LO Chua, LK Chen . Diacoptic and generalized hybrid analysis. IEEE Trans. Journal of Microwave Engineering & Technologies Volume 6, Issue 3 ISSN: 2349-9001 JoMET (2019) 11-17 © STM Journals 2019. All Rights Reserved Page 17 Circuits Syst. Dec. 1976 ;CAS-23;694–
- 15. S Darlington . A survey of network & Iization techniques . IRETrans. Circuit Theory. CT-2. n 291. 1955
- F Wu . Solutions of large -scale networks by tearing. IEEE Trans. Circuits Syst. Dec. 1976;23(12):706–714.
- FiaIkow, I Gerst. The transfer function of networks without mutual reactance. Quart. Appl. Math. JuIv 1954;12(2):117–131.
- RM Foster. An open question IRE Trans. Circuit Theory. June 1961;8:175. Cite this Article Richa Agarwal, Rakhi Trivedi . Network Analysis and Synthesis Through Graph Theory as a Tool . Journal of Microwave Engineering & Technologies . 2019; 6( 3): 11–17p.