Network Topology MCQs

Practice Network Topology MCQs with four options, answers and explanations for focused Electronics & Telecommunication Engineering revision.

Question 1

Network TheoryNetwork Topology

A network contains 8 branches, 5 nodes, and is connected. The number of independent loops is?

Show AnswerHide Answer Report an error

Correct Answer: C. 4

Explanation: For a connected network, the number of independent loops is b-n+1=8-5+1=4.

Reference: Standard network theory: graph topology

Question 2

Network TheoryNetwork Topology

For a connected network having n nodes, the number of branches in any tree is?

An
Bn-1
Cn+1
D2n

Show AnswerHide Answer Report an error

Correct Answer: B. n-1

Explanation: A tree connects all n nodes without forming a closed path and therefore contains exactly n-1 branches.

Reference: Standard network theory: tree

Question 3

Network TheoryNetwork Topology

A branch of a network graph that belongs to a selected tree is called a?

ALink
BTwig
CChord only
DCut-set

Show AnswerHide Answer Report an error

Correct Answer: B. Twig

Explanation: Branches included in a tree are called twigs. Branches not included in the tree are links or chords.

Reference: Standard network theory: tree and twigs

Question 4

Network TheoryNetwork Topology

If a connected graph has 10 branches and its tree contains 6 twigs, the number of links is?

Show AnswerHide Answer Report an error

Correct Answer: B. 4

Explanation: Every branch is either a twig or a link, so links=10-6=4.

Reference: Standard network theory: links

Question 5

Network TheoryNetwork Topology

A fundamental loop is formed when?

AOne link is added to a tree
BOne twig is removed from every graph
CAll nodes are shorted together
DAll voltage sources are opened

Show AnswerHide Answer Report an error

Correct Answer: A. One link is added to a tree

Explanation: A tree contains no closed path. Adding any one link to it creates exactly one fundamental loop.

Reference: Standard network theory: fundamental loops

Question 6

Network TheoryNetwork Topology

A fundamental cut-set associated with a tree is obtained conceptually by removing?

AOne twig
BOne link only
CEvery branch
DOne node and all remaining nodes

Show AnswerHide Answer Report an error

Correct Answer: A. One twig

Explanation: Removing a twig separates the tree into two parts; the removed twig together with links reconnecting those parts forms its fundamental cut-set.

Reference: Standard network theory: fundamental cut-set

Question 7

Network TheoryNetwork Topology

For an oriented network graph with n nodes, the rank of the complete incidence matrix of a connected graph is?

An
Bn-1
Cb-n+1
Db

Show AnswerHide Answer Report an error

Correct Answer: B. n-1

Explanation: For a connected graph, one incidence-matrix row is dependent on the others, so its rank is n-1.

Reference: Standard network theory: incidence matrix

Question 8

Network TheoryNetwork Topology

In a connected planar graph with n nodes and b branches, the number of independent meshes is?

An-1
Bb-n+1
Cb+n-1
Db-1

Show AnswerHide Answer Report an error

Correct Answer: B. b-n+1

Explanation: For a connected planar network, the number of independent meshes is b-n+1.

Reference: Standard network theory: planar graph topology

Question 9

Network TheoryNetwork Topology

A connected network graph has 7 nodes and 11 branches. How many independent cut-set equations can be formed from a tree?

Show AnswerHide Answer Report an error

Correct Answer: B. 6

Explanation: A tree of a connected graph has n-1 twigs, and each twig defines one fundamental cut-set. Thus 7-1=6.

Reference: Standard network theory: fundamental cut-set count

Question 10

Network TheoryNetwork Topology

For an oriented graph, each column of the node-branch incidence matrix corresponding to an ordinary branch contains?

AOne +1 and one -1
BTwo +1 entries only
COne nonzero entry only
DAll zero entries

Show AnswerHide Answer Report an error

Correct Answer: A. One +1 and one -1

Explanation: An oriented branch leaves one node and enters another, so its incidence-matrix column has one +1 and one -1 under a consistent sign convention.

Reference: Standard network theory: incidence matrix structure

Question 11

Network TheoryNetwork Topology

If one row is deleted from the incidence matrix of a connected graph, the resulting reduced incidence matrix has how many rows for n nodes?

An
Bn-1
Cb-n+1
Db

Show AnswerHide Answer Report an error

Correct Answer: B. n-1

Explanation: Deleting the dependent reference-node row leaves a reduced incidence matrix with n-1 rows.

Reference: Standard network theory: reduced incidence matrix

Question 12

Network TheoryNetwork Topology

A tie-set matrix is primarily used to express branch currents in terms of?

AIndependent loop currents
BNode voltages only
CBranch powers
DCut-set voltages only

Show AnswerHide Answer Report an error

Correct Answer: A. Independent loop currents

Explanation: Tie-set or fundamental-loop analysis relates branch currents to a set of independent loop currents.

Reference: Standard network theory: tie-set matrix

Question 13

Network TheoryNetwork Topology

A cut-set matrix is particularly associated with writing independent forms of?

AKCL equations
BKVL equations only
CPower equations only
DTransformer equations

Show AnswerHide Answer Report an error

Correct Answer: A. KCL equations

Explanation: Cut-set equations express current conservation across cuts of a graph and therefore provide independent KCL relations.

Reference: Standard network theory: cut-set matrix