We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
Firstly, a graph G consists of a vertex set V (G), and an edge set E (G) of endpoints which relate two vertices with each edge. Also, a decomposition of a graph is a list of subgraphs such that each edge appears in exactly one subgraph in the list. In the field of graph theory, graph decomposition is an active field of research. A graph pair is a pair of graphs on the same vertex set whose union is the complete graph. Abueida and Daven studied decompositions of complete graphs into graph-pairs of order four and five. We are extending their results by investigating which complete graphs decompose into a specific graph pair of order 6
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.