CO-SEGREGATED POLYNOMIAL OF GRAPHS
A graph is co-segregated if then. The co-segregated polynomial of a graph of order is given by, where is the number of co-segregated subgraphs of order. We characterize a co-segregated subgraph of a graph and also of a graph under some binary operations. Using these characterizations, we obtain co-segregated polynomials of such graphs.
co-segregated, co-segregated polynomial
Received: July 7, 2023; Accepted: July 29, 2023; Published: August 1, 2023
