Counting the number of connected graphs labelled vertices of order six containing odd number of loops

Given graph G (V, E) if there is at least one path connecting two vertices in G, it is called a connected graph; otherwise, it is called a disconnected graph. A labelled graph is one in which each vertex or edge has a value or label assigned to it. If given n, m, where n is the number of vertices and m is the number of edges, where all vertices are labelled differently, many graphs can be created, either connected or not connected, simple or not. A loop is defined as an edge that begins and ends in the same vertex, whereas parallel edges are defined as two or more edges that connect the same pair of vertices. In this study how to count the number of connected graphs labelled vertices of order six containing odd number of loops and no parallel edges.