Discete Math
1) Let G be the graph whose vertices are all permutations of the integers of the set {1,2,?,10} with the property that two vertices (?1,?2,?,?10) , (??1,??2, ...,??10) are connected by an edge if one vertex arises from the other by exchanging the positions of two integers ?i,?j with ?i,?j?5
For example the vertices (1,2,7,4,8,5,3,10,9,6), (1,5,7,4,8,2,3,10,9,6) form an edge, vertices (1,2,4,8,10,7,3,5,9,6), (1,10,4,8,2,7,3,5,9,6) do not form an edge, vertices (1,7,2,4,8,10,3,5,9,6) , (1,10,2,4,8,7,3,5,9,6) do not form an edge. Find the number of edges of the graph G
2)How many induced subgraphs with 4 vertices does the complete graph K10 have? (We consider the vertices of K10 distinguished, i.e. named from 1 to 10)
3) The graph in the figure below is bipartite. Right or wrong?
Answer
- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.
1 Attachment
- answered
- 146 views
- $20.00
Related Questions
- [Discrete Mathematics] Big-O Notation
- Induction proof for an algorithm. Introductory level discrete math course. See attachment for details
- In how many different ways $n$ persons can seat around a round table?
- Why does this spatial discretization with n intervals have a position of (n-1)/n for each interval?
- Set Theory Question Help
- Solve summation problem: $\sum_{k=1}^{n} \tfrac{2k+1}{k^{2}(k+1)^2 } $
- Discrete math
- [Discrete Mathematics] Algorithm and Pseudocode - Write an algorithm to find the roots of a quadratic equation ax2 + bx + c = 0. Write Pseudocode of algorithm.