Register

k 3,4 graph

27,876 views
1 1 vote

The graph $K_{3,4}$ has

  1. 3 edges
  2. 4 edges
  3. 7 edges
  4. 12 edges

3 Answers

1 1 vote

Ans : D. A bipartite graph is a complete bipartite graph if every vertex in U is connected to every vertex in V. If U has n elements and V has m, then the resulting complete bipartite graph can be denoted by K n,m and the number of edges is given by n*m.
The number of edges = K 3,4 = 3 * 4 = 12

Voting & Accepting an answer helps improve the community
← Previous · Procedure to Delete...Next → · broadcast networks
← Previous in category · a graph with n verti...Next in category → · ISI2011-PCB-CS-3b
Position:
Show:

Related questions

0 0 votes
1 1 answer
4.0k
4.0k views
neha singh asked Oct 11, 2016
3,963 views
What is largest no of maximal independent set of complete bipartite graph K(4,2)?
What is largest number of maximal independent set of complete bipartite graph K(4,2)?a)2b)3c)4d)6
0 0 votes
1 answers 1 answer
3.6k
3.6k views
Crime Master Gogo asked May 3, 2017
3,606 views
Relation between k and k-1 edge connected graph
Is every k connected graph is k-1 connected or the reverse? I always get confused. Can someone explain with the help of an example.
2 2 votes
1 answers 1 answer
4.7k
4.7k views
Akriti sood asked Nov 28, 2016
4,739 views
Let G be a K-regular bipartite graph with k ≥ 2. Then G has no cut edge
how is this statement correct..can some one give an example??Let G be a K-regular bipartite graph with k ≥ 2. Then G has no cut edge
0 0 votes
1 1 answer
1.1k
1.1k views
sonalrawat asked Aug 21, 2023
1,105 views
Consider the following strategy to convert an undirected graph with negative edge weights to one that does not have negative edge weights. Let the maximum magnitude negative edge weight in the graph be -k. Then, for each edge in the graph with weight w, update the weight to w+k+1. Consider the following claim: To solve the shortest path problem in the original graph, we can run Dijkstra's algorithm on the modified graph and subtract the added weights to get the original distances. Which of the following is not correct. The claim is not true in general. The claim is not true in general for graphs with cycles. The claim is true for connected acyclic graphs. The claim is true for all graphs.