ScholarLens Back to search
2009•Journal of Guizhou UniversityRequires access

On Adjacent Strong Vertex-Distinguishing Total Coloring of P_m×C_n

MA Shao-xian

Open publisher page 0 citations

Abstract

A total-coloring of a graph is called adjacent strong vertex-distinguishing if any two adjacent vertices are incident to different sets of colored vertex and incident edge with vertex.The minimum number of colors which were required for a adjacent vertex-distinguishing proper total coloring is called the adjacent strong vertex-distinguishing total chromatic number.The adjacent strong vertex distinguishing total chromatic number of Pm×Cn were given in this paper.

About this research paper

What this paper is about

A total-coloring of a graph is called adjacent strong vertex-distinguishing if any two adjacent vertices are incident to different sets of colored vertex and incident edge with vertex.The minimum number of colors which were required for a adjacent vertex-distinguishing proper total coloring is called the adjacent strong vertex-distinguishing total chromatic number.The adjacent strong vertex distinguishing total chromatic number of Pm×Cn were given in this paper.

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

A total-coloring of a graph is called adjacent strong vertex-distinguishing if any two adjacent vertices are incident to different sets of colored vertex and incident edge with vertex.The minimum number of colors which were required for a adjacent vertex-distinguishing proper total coloring is called the adjacent strong vertex-distinguishing total chromatic number.The adjacent strong vertex distinguishing total chromatic number of Pm×Cn were given in this paper.

Key concepts: Combinatorics, Vertex (graph theory), Fractional coloring, Total coloring, Chromatic scale, Mathematics, Neighbourhood (mathematics), Complete coloring

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On Adjacent Strong Vertex-Distinguishing Total Coloring of P_m×C_n — Research Paper | ScholarLens