code: def mycielski_graph(n):
      """Generator for the n_th Mycielski Graph.
  
      The Mycielski family of graphs is an infinite set of graphs.
      :math:`M_1` is the singleton graph, :math:`M_2` is two vertices with an
      edge, and, for :math:`i > 2`, :math:`M_i` is the Mycielskian of
      :math:`M_{i-1}`.
  
      More information can be found at
      http://mathworld.wolfram.com/MycielskiGraph.html
  
      Parameters
      ----------
      n : int
          The desired Mycielski Graph.
  
      Returns
      -------
      M : graph
          The n_th Mycielski Graph
  
      Notes
      -----
      The first graph in the Mycielski sequence is the singleton graph.
      The Mycielskian of this graph is not the :math:`P_2` graph, but rather the
      :math:`P_2` graph with an extra, isolated vertex. The second Mycielski
      graph is the :math:`P_2` graph, so the first two are hard coded.
      The remaining graphs are generated using the Mycielski operation.
  
      """
  
      if n < 1:
          raise nx.NetworkXError("must satisfy n >= 1")
  
      if n == 1:
          return nx.empty_graph(1)
  
      else:
          return mycielskian(nx.path_graph(2), n - 2)
  
imports: import networkx
  from networkx.utils import not_implemented_for
label_desc: Use image node_id 2 for calling a global function with example usage: mycielski_graph(n) and returns: nx, mycielskian