Omega Invariant of Complement Graphs and Nordhaus-Gaddum Type Results.

Abstract

The study aimed to obtain relationships between the omega invariants of a graph and its complement. We used some graph parameters, including the cyclomatic numbers, number of components, maximum number of components, order, and size of both graphs G and G. Also, we used triangular numbers to obtain our results related to the cyclomatic numbers and omega invariants of G and G. Several bounds for the above graph parameters have been obtained by the direct application of the omega invariant. We used combinatorial and graph theoretical methods to study formulae, relations, and bounds on the omega invariant, the number of faces, and the number of compo-nents of all realizations of a given degree sequence. Especially so-called Nordhaus-Gaddum type resulted in our calculations. In these calculations, the triangular numbers less than a given number play an important role. Quadratic equations and inequalities are intensively used. Several relations between the size and order of the graph have been utilized in this study. In this paper, we have obtained relationships between the omega invariants of a graph and its complement in terms of several graph parameters, such as the cyclomatic numbers, number of components, maximum number of components, order, and size of G and G, and triangular numbers. Some relationships between the omega invariants of a graph and its complement have been obtained.