Prepare
Practice
Interview
Aptitude
Reasoning
English
GD
Placement papers
HR
Current affairs
Engineering
MCA
MBA
Online test
Login
n-1 fundamental cutsets for 'n' number of nodes in graph
Home
>>
Category
>>
Electronic Engineering (MCQ) questions & answers
>>
Network Theory
Q. How many fundamental cutsets will be generated for a graph with 'n' number of nodes?
- Published on 06 Oct 15
a.
n+1
b.
n-1
c.
n
2
(n-1)
d.
n/ n-1
ANSWER: n-1
Related Content
Electronic Devices & Circuits (
93
)
Electronics Product Design (
119
)
Digital Electronics (
108
)
Antenna & Wave Propagation (
100
)
Electromagnetics & Transmission Lines (
88
)
Network Theory (
109
)
Control Systems (
120
)
Analog Communication (
197
)
Basic Electronics Engineering (
331
)
Computer Network (
112
)
Digital Communication (
124
)
Microcontrollers and Applications (
270
)
Mobile Communication (
156
)
Telecommunication and Switching Systems (
60
)
Integrated Circuits (
70
)
Information Theory and Coding Techniques (
70
)
Optical Fiber Communication (
100
)
Embedded Processors (
60
)
VLSI Design & Technology (
100
)
Digital Signal Processing (
120
)
Signals & Systems (
73
)
➨
Post your comment / Share knowledge
Required!
Required!
Invalid Email Id!
Required!
Enter the code shown above:
Please enter the code shown above
(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
MCQs
English
Tutorials
Download
▲
