Prepare
Practice
Interview
Aptitude
Reasoning
English
GD
Placement papers
HR
Current affairs
Engineering
MCA
MBA
Online test
Login
Online Practice Test
>
Data Structure
« Previous
Next »
In graphs, A hyperedge is an edge that is allowed to take on any number of _____________
Options
- Vertices
- edges
- both a and b
- labels
CORRECT ANSWER : Vertices
Discussion Board
echo Alert::widget([ 'options' => ['class' => 'alert-info'], 'body' => Yii::$app->session->getFlash('postDeleted'), ]);
echo Alert::widget([
'options' => ['class' => 'alert-info'],
'body' => Yii::$app->session->getFlash('postDeleted'),
]);
echo Alert::widget([ 'options' => ['c 03-25-2017 01:40 PM
Data Structure - Hyperedge
In graphs, A hyperedge is an edge that is allowed to take on any number of vertices. Hypergraphs are generalized graphs where each edge may link subsets of more than two vertices. A hyperedge is a set of vertices of a hypergraph.
Prajakta Pandit 01-31-2017 11:30 PM
A hyperedge is an edge that is allowed to take on any number of vertices, possibly more than 2. A graph that allows any hyperedge is called a hypergraph.
Correct answer is Vertices.
Naveena 11-19-2014 03:40 AM
graphs
should be vertices or nodes. Edges only connect to nodes in graphs
jian 06-13-2014 08:51 AM
« Previous
Next »
Write your comments
*
*
Email must be in the form someone@domain.com
*
*
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.)
Related Content
C test (42)
C (12)
C++ for beginners (10)
C++ (20)
C++ (24)
C++ (18)
C++ (14)
C++ (12)
C++ (15)
C++ (15)
Data structure (20)
Data structure (10)
Data structure (10)
Data structure (10)
PERL (25)
VC++ (11)
Oops (30)
Mainframe (41)
Mainframe (15)
Embedded systems (15)
OOAD (49)
Advertisement
▲