Discussion
What does the term "cut-set" refer to in network analysis ?
Answer: D
A cut-set is a set of branches that, if cut, will divide the network into two parts.
In network topology, a cut-set is a minimal set of branches whose removal separates the graph into exactly two connected parts; removing any fewer branches leaves it connected. Each tree branch defines a fundamental cut-set, and Kirchhoff's current law applied to each cut-set gives the independent node-type equations of the network.
A cut-set is defined by the graph, not by the type of element in the branches, so it is not a set of parallel or series resistors or a combination of resistors and capacitors.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development