This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 2 years, 6 months ago.

  • Author
    Posts
  • #1427797 Reply
     EduGorilla 
    Keymaster
    Select Question Language :


    Let G = (V, E) be a graph, where V = {0, 1}n i.e. V is the set of vertices that has one to one correspondence with the set of all n-bit binary strings, where n is the positive integers. There will be an edge between two vertices u and v, if they differ exactly by one bit. For n = 8, The no. of edges in the graph is ______________?

    Options :-

      Post your Training /Course Enquiry
      Are You looking institutes / coaching center for
      • IIT-JEE, NEET, CAT
      • Bank PO, SSC, Railways
      • Study Abroad
      Select your Training / Study category
    Reply To: Let G = (V, E) be a graph, where V = {0, 1}n i.e. V is the set of vertices that has one to one corre….
    Your information:




    Verify Yourself




    Log in with your credentials

    or    

    Forgot your details?

    Create Account