Content deleted Content added
GreenC bot (talk | contribs) Rescued 1 archive link. Wayback Medic 2.5 |
Citation bot (talk | contribs) Add: series. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 3455/3850 |
||
Line 35:
== Domain of application ==
Robichaud ''et al.'' identify the ___domain of application of SFGs as follows:<ref name=Robichaud>
{{cite book |title=Signal flow graphs and applications |author1=Louis PA Robichaud |author2=Maurice Boisvert |author3=Jean Robert |year=1962 |publisher=Prentice Hall |chapter-url=http://babel.hathitrust.org/cgi/pt?id=uc1.b4338380;view=1up;seq=8 |asin=B0000CLM1G |chapter = Preface |series=Prentice-Hall electrical engineering series |page=x}}
</ref>
:"All the physical systems analogous to these networks [constructed of ideal transformers, active elements and gyrators] constitute the ___domain of application of the techniques developed [here]. Trent<ref name=Trent>
Line 147:
** '''Residual node.''' In any contemplated process of graph reduction, the nodes to be retained in the new graph are called residual nodes.<ref name=Mason/>
* '''Splitting a node.''' Splitting a node corresponds to splitting a node into two half nodes, one being a sink and the other a source.<ref name=Robichaud2>
{{cite book |title=Signal flow graphs and applications |author1=Louis PA Robichaud |author2=Maurice Boisvert |author3=Jean Robert |year=1962 |publisher=Prentice Hall |chapter-url=http://babel.hathitrust.org/cgi/pt?id=uc1.b4338380;view=1up;seq=8 |asin=B0000CLM1G |chapter = §1-4: Definitions and terminology |series=Prentice-Hall electrical engineering series |page=8}}
</ref>
* '''Index''': The index of a graph is the minimum number of nodes which have to be split in order to remove all the loops in a graph.
Line 529:
* {{cite book|author1=Ernest J. Henley |author2=R. A. Williams |name-list-style=amp |title=Graph theory in modern engineering; computer aided design, control, optimization, reliability analysis|year=1973|publisher=Academic Press|isbn=978-0-08-095607-7}} Book almost entirely devoted to this topic.
*{{Citation |last=Kou|first= Benjamin C. |year= 1967 |title= Automatic Control Systems|publisher= Prentice Hall }}
*{{cite book|last=Robichaud|first=Louis P.A. |author2= Maurice Boisvert|author3= Jean Robert|year= 1962 |title=Signal flow graphs and applications |series=Prentice-Hall electrical engineering series |pages=xiv, 214 p |publisher= Prentice Hall|___location=Englewood Cliffs, N.J.|url=http://babel.hathitrust.org/cgi/pt?id=uc1.b4338380}}
*{{Citation |last=Deo|first=Narsingh |year= 1974|title= Graph Theory with Applications to Engineering and Computer Science|pages= 418|publisher= PHI Learning Pvt. Ltd.|isbn= 978-81-203-0145-0|url=https://books.google.com/books?id=Yr2pJA950iAC}}
*{{cite book |title=Graphs: Theory and algorithms |author1=K Thulasiramen |author2=MNS Swarmy |chapter=§6.11 The Coates and Mason graphs |pages=163 ''ff'' |chapter-url=https://books.google.com/books?id=rFH7eQffQNkC&pg=PA163 |publisher=John Wiley & Sons |year=2011 |isbn=9781118030257}}
*{{cite book|last=Ogata|first=Katsuhiko |year= 2002|title= Modern Control Engineering 4th Edition|publisher= Prentice-Hal |chapter=Section 3-9 Signal Flow Graphs|isbn=978-0-13-043245-2}}
* {{Cite thesis |last= Phang |first= Khoman |title= CMOS Optical Preamplifier Design Using Graphical Circuit Analysis|chapter= ''2.5 An overview of Signal-flow graphs'' |chapter-url= http://www.eecg.toronto.edu/~kphang/papers/PhDthesis.pdf|date= 2000-12-14
==Further reading==
| |||