The Adjacent Vertex Distinguishing Incidence Coloring of Some Infinite Planar Graph

Qian Wang; Shuang Liang Tian

doi:10.4028/www.scientific.net/AMM.543-547.1769

Paper Titles

Application of Matrix and Algorithm Implementation in Source Entropy Calculation
p.1747

One Class Series of Reciprocals of Non-Central Binomial Coefficients
p.1751

An Algorithm for Mesh Simplification Based on Energy-Aware
p.1757

Bifurcation Research Two-Dimensional XYX Quantum Model Based on Fidelity
p.1764

The Adjacent Vertex Distinguishing Incidence Coloring of Some Infinite Planar Graph
p.1769

Convergence of Bivariate Interpolation and its Computation
p.1773

The Algorithm of Passive Location of Emitter Based on LOB
p.1777

Missile Assault to Surface Signed Digraph Model of Aviation Based on Information Support
p.1782

Shore-Based Air-Defence Unit Shooting Mode Optimization Model Research
p.1786

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 543-547The Adjacent Vertex Distinguishing Incidence...

The Adjacent Vertex Distinguishing Incidence Coloring of Some Infinite Planar Graph

Abstract:

An adjacent vertex distinguishing incidence coloring of graph of G is an incidence coloring of G such that no pair of adjacent vertices meets the same set of colors. We obtain the adjacent vertex distinguishing incidence chromatic number of the Cartesian product of triangular lattice and infinite path, and hexagonal lattice and infinite path.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 543-547)

Pages:

1769-1772

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.543-547.1769

Citation:

Cite this paper

Online since:

March 2014

Authors:

Qian Wang*, Shuang Liang Tian

Keywords:

Adjacent Vertex Distinguishing Incidence Chromatic Number, Adjacent Vertex Distinguishing Incidence Coloring, Infinite Planar Graphs

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] J. A. Bondy, U. S. R. Murty. Graph Theory with Applications [M]. New York: American Elsevier, (1976).

Google Scholar

[2] Chen Dongling, Liu Xikui. The Incidence Chromatic Number and the Incidence Coloring Conjecture of Graphs [J]. Journal of Mathematics In Economics, 1998, 15(3): 47-51.

Google Scholar

[3] Wang Yaqin. The incidence coloring and adjacent vertex distingushing incidence coloring of graphs [D]. Shandong: Shandong University of Science and Technology, (2007).

Google Scholar

[4] QIAN WANG, SHUANGLIANG TIAN. Acyclic coloring of triangular lattice and hexagonal lattice[J]. Advances and Applications in Mathematical Sciences，2010, 1(5): 17-23.

Google Scholar

[5] Chen xuegang Chen dongling. On Incidence Chromatic Number of Three Classes of Cartesian Product Graphs[J]. Mathematics in Economics, 2002, 19(3): 88-90.

Google Scholar

[6] Wilfried Imrich, Janja Jerebic，Sandi Klavzar. The distinguishing number of Cartesian product of complete graphs. European Journal of Combinatorics, 2008, 29: 922-929.

DOI: 10.1016/j.ejc.2007.11.018

Google Scholar