ScholarLens Back to search
2012•Shuxue de shijian yu renshiRequires access

Adjacent Vertex-distinguishing VI-total Chromatic Number and Adjacent Vertex-Distinguishing E-total Chromatic Number of Graphs

Sun Chun-hu

Open publisher page 0 citations

Abstract

The adjacent vertex-distinguishingⅥ-total chromatic number of path,cycle, complete graph,wheel and fan are discussed by using color one by one and recursion.The adjacent vertex-distinguishing E-total coloring is researched by the probability method.Then given an upper bound for the adjacent vertex-distinguishing E-total chromatic number.Ifδ≥7 and△≥28,then X_(at)~e(G)≤10△is proved,whereδis the minimum degree of G,and△is the maximum degree of G.

About this research paper

What this paper is about

The adjacent vertex-distinguishingⅥ-total chromatic number of path,cycle, complete graph,wheel and fan are discussed by using color one by one and recursion.The adjacent vertex-distinguishing E-total coloring is researched by the probability method.Then given an upper bound for the adjacent vertex-distinguishing E-total chromatic number.Ifδ≥7 and△≥28,then X_(at)~e(G)≤10△is proved,whereδis the minimum degree of G,and△is the maximum degree of G.

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

The adjacent vertex-distinguishingⅥ-total chromatic number of path,cycle, complete graph,wheel and fan are discussed by using color one by one and recursion.The adjacent vertex-distinguishing E-total coloring is researched by the probability method.Then given an upper bound for the adjacent vertex-distinguishing E-total chromatic number.Ifδ≥7 and△≥28,then X_(at)~e(G)≤10△is proved,whereδis the minimum degree of G,and△is the maximum degree of G.

Key concepts: Combinatorics, Vertex (graph theory), Chromatic scale, Mathematics, Graph, Brooks' theorem, Discrete mathematics, 1-planar graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Adjacent Vertex-distinguishing VI-total Chromatic Number and Adjacent Vertex-Distinguishing E-total Chromatic Number of Graphs — Research Paper | ScholarLens