code: def octahedral_graph(create_using=None):
      """
      Returns the Platonic Octahedral graph.
  
      The octahedral graph is the 6-node 12-edge Platonic graph having the
      connectivity of the octahedron [1]_. If 6 couples go to a party,
      and each person shakes hands with every person except his or her partner,
      then this graph describes the set of handshakes that take place;
      for this reason it is also called the cocktail party graph [2]_.
  
      Parameters
      ----------
      create_using : NetworkX graph constructor, optional (default=nx.Graph)
         Graph type to create. If graph instance, then cleared before populated.
  
      Returns
      -------
      G : networkx Graph
          Octahedral graph
  
      References
      ----------
      .. [1] https://mathworld.wolfram.com/OctahedralGraph.html
      .. [2] https://en.wikipedia.org/wiki/Tur%C3%A1n_graph#Special_cases
  
      """
      G = nx.from_dict_of_lists(
          {0: [1, 2, 3, 4], 1: [2, 3, 5], 2: [4, 5], 3: [4, 5], 4: [5]},
          create_using=create_using,
      )
      G.name = "Platonic Octahedral Graph"
      return G
  
imports: from functools import wraps
  import networkx
  from networkx.exception import NetworkXError
  from networkx.generators.classic import complete_graph, cycle_graph, empty_graph, path_graph
label_desc: Use image node_id 17 for calling a global function with example usage: octahedral_graph(create_using) and returns: G