Hypercube Graph

13 May, 2022
You are given input as order of graph n (highest number of edges connected to a node), you have to find the number of vertices in a Hypercube graph of order n. Examples:  
Input : n = 3
Output : 8

Input : n = 2
Output : 4
 
In hypercube graph Q(n), n represents the degree of the graph. Hypercube graph represents the maximum number of edges that can be connected to a graph to make it an n degree graph, every vertex has the same degree n and in that representation, only a fixed number of edges and vertices are added as shown in the figure below: 
All hypercube graphs are Hamiltonian, hypercube graph of order n has (2^n) vertices, , for input n as the order of graph we have to find the corresponding power of 2.  
C++
Java
Python3
C#
PHP
Javascript
// C++ program to find vertices in a hypercube// graph of order n#include <iostream>using namespace std; // function to find power of 2int power(int n){    if (n == 1)        return 2;    return 2 * power(n - 1);} // driver programint main(){    // n is the order of the graph    int n = 4;    cout << power(n);    return 0;}
// Java program to find vertices in// a hypercube graph of order nclass GfG{     // Function to find power of 2    static int power(int n)    {        if (n == 1)            return 2;        return 2 * power(n - 1);    }         // Driver program    public static void main(String []args)    {                 // n is the order of the graph        int n = 4;        System.out.println(power(n));    }} // This code is contributed by Rituraj Jain
# Python3 program to find vertices in a hypercube#  graph of order n # function to find power of 2def power(n):    if n==1:        return 2    return 2*power(n-1)  # Driver coden =4print(power(n))  # This code is contributed by Shrikant13
// C# program to find vertices in// a hypercube graph of order nusing System; class GfG{     // Function to find power of 2    static int power(int n)    {        if (n == 1)            return 2;        return 2 * power(n - 1);    }         // Driver code    public static void Main()    {                 // n is the order of the graph        int n = 4;        Console.WriteLine(power(n));    }} // This code is contributed by Mukul Singh
<?php// PHP program to find vertices in// a hypercube graph of order n{     // Function to find power of 2    function power($n)    {        if ($n == 1)            return 2;        return 2 * power($n - 1);    }         // Driver Code    {                 // n is the order of the graph        $n = 4;        echo(power($n));    }} // This code is contributed by Code_Mech?>
<script>  // Javascript program to find vertices in a hypercube// graph of order n // function to find power of 2function power(n){    if (n == 1)        return 2;    return 2 * power(n - 1);} // driver program// n is the order of the graphvar n = 4;document.write( power(n)); </script>
Output:  
16
 
shrikanth13
rituraj_jain
Code_Mech
rutvik_56
sumitgumber28
Graph
Graph
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Find if there is a path between two vertices in a directed graph
Introduction to Data Structures
What is Data Structure: Types, Classifications and Applications
Find if there is a path between two vertices in an undirected graph
Minimum steps to reach target by a Knight | Set 1
Top 50 Graph Coding Problems for Interviews
Bridges in a graph
Water Jug problem using BFS
Detect Cycle in a Directed Graph using BFS
Longest Path in a Directed Acyclic Graph