2001•Journal of Mathematics and TechnologyRequires access

Clique Covering Number and Clique Partition Number on the Graph of n Cycle Intermediate Spoke

Li Wan

Abstract

In this paper, after discussing the clique covering num be r and clique partition number on the graph of the Petersen generalizing graph- n cycle intermediate spoke graph, we obtain the result that the clique cover ing number and clique partition number of the graph are equal. And then, we prov ide the computational formula of the graph.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Mathematics, Simplex graph, Clique graph, Combinatorics, Split graph, Block graph, Perfect graph, Partition (number theory)