The Smarandachely Adjacent Vertex Total Coloring of a kind of 3-regular Graph

Title
The Smarandachely Adjacent Vertex Total Coloring of a kind of 3-regular Graph
Author(s)
이재운Zeiwen Wang[Zeiwen Wang]Jianwen Li[Jianwen Li]Fei Wen[Fei Wen]
Keywords
NUMBERS
Issue Date
201104
Publisher
CHARLES BABBAGE RES CTR
Citation
ARS COMBINATORIA, v.99, pp.45 - 53
Abstract
A proper total coloring of a graph G is called smarandachely adjacent vertex total coloring of graph if for any two adjacent and distinct vertices u and v in G, the set of colors assigned to the vertices and the edges incident to u doesn't contain the set of colors assigned to the vertices and the edges incident to v, vice versa. The minimal number of colors required for a smarandachely adjacent vertex total coloring of graph is called the smarandachely adjacent vertex total chromatic number of graph. In this paper,we define a kind of 3-regular Multi layer Cycle Re(n, m) and obtain the Smarandachely adjacent vertex total chromatic number of it.
URI
http://hdl.handle.net/YU.REPOSITORY/25365
ISSN
0381-7032
Appears in Collections:
이과대학 > 수학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE