Linear Network Theory presents the problems of linear network analysis and synthesis. This book discusses the theory of linear electrical circuits, which is important for developing the scientific outlook of specialists in radio and electrical engineering. Organized into 13 chapters, this book begins with an overview of circuit theory that operates with electrical quantities, including voltage, charge, and current. This text then examines sinusoidal function as the predominant form of a periodic process in electrical circuits. Other chapters consider the reduction of a series–parallel network to single equivalent impedance, which is one of the main forms of converting circuit diagrams often used in practice. The final chapter deals with the Laplace transformation or operational calculus, which is a combination of methods of mathematical analysis. This book is intended to be suitable for students in the specialized branches of electrical and radio engineering, post-graduates, and engineers extending their theoretical knowledge.

This comprehensive look at linear network analysis and synthesis explores state-space synthesis as well as analysis, employing modern systems theory to unite classical concepts of network theory. 1973 edition.

A rigorous treatment of the essential mathematical structure of network synthesis problems, written by an eminent researcher in the field.

Linear Network Theory covers the significant algebraic aspect of network theory, with minimal reference to practical circuits. The book begins the presentation of network analysis with the exposition of networks containing resistances only, and follows it up with a discussion of networks involving inductance and capacity by way of the differential equations. Classification and description of certain networks, equivalent networks, filter circuits, and network functions are also covered. Electrical engineers, technicians, electronics engineers, electricians, and students learning the intricacies of network theory will find this book helpful.

This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reorganized. Whilst this book will be invaluable to students and researchers in graph theory and combinatorial matrix theory, it will also benefit readers in the sciences and engineering.