Calculating the Number of vertices Labeled Order Six Disconnected Graphs which Contain Maximum Seven Loops and Even Number of Non-loop Edges Without Parallel Edges

A labeled graph is a graph where each vertex or edge is given a value or label. A line/edge with the same starting and ending vertex is called a loop. If given n vertices and m edges, then there are lot disconnected vertices labeled graphs that can be formed. Among those graphs, there are graphs with maximum seven loops and whose non-loop edges are even. In this research, we will discuss the formula for finding that kinds of graphs.