The Locating-Chromatic Number of Binary Trees

被引：7

作者：

Syofyan, Dian Kastika ^{[1
]}

Baskoro, Edy Tri ^{[1
]}

Assiyatun, Hilda ^{[1
]}

机构：

[1] Inst Teknol Bandung, Fac Math & Nat Sci, Combinatorial Math Res Grp, Jalan Ganesa 10, Bandung 40132, Indonesia

来源：

2ND INTERNATIONAL CONFERENCE OF GRAPH THEORY AND INFORMATION SECURITY | 2015年 / 74卷

关键词：

Color code; locating-chromatic number; tree graph; binary tree;

D O I：

10.1016/j.procs.2015.12.079

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Let G = (V, E) be a connected graph. The locating-chromatic number of G, denoted by chi(L)(G), is the cardinality of a minimum locating coloring of the vertex set V(G) such that all vertices have distinct coordinates. The results on locating-chromatic number of graphs are still limited. In particular, the locating-chromatic number of trees is not completely solved. Therefore, in this paper, we study the locating-chromatic number of any binary tree. (C) 2015 The Authors. Published by Elsevier B.V.

引用

页码：79 / 83

页数：5

共 50 条

[41] On generating all binary trees
Skarbek, Wladyslaw
FUNDAMENTA INFORMATICAE, 2007, 75 (1-4) : 505 - 536
[42] The geometry and dynamics of binary trees
David, T.
van Kempen, Thomas
Huang, Huaxiong
Wilson, Phillip
MATHEMATICS AND COMPUTERS IN SIMULATION, 2011, 81 (07) : 1464 - 1481
[43] A simple bijection between binary trees and colored ternary trees
Sun, Yidong
ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01)
[44] Renormalization of QED with planar binary trees
Ch. Brouder
A. Frabetti
The European Physical Journal C - Particles and Fields, 2001, 19 : 715 - 741
[45] Binary trees with choosable edge lengths
Massberg, Jens
Rautenbach, Dieter
INFORMATION PROCESSING LETTERS, 2009, 109 (18) : 1087 - 1092
[46] The Euclidean Distortion of Complete Binary Trees
Discrete & Computational Geometry, 2002, 29 : 19 - 21
[47] Profile of Random Exponential Binary Trees
Feng, Yarong
Mahmoud, Hosam
METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY, 2018, 20 (02) : 575 - 587
[48] Optimal binary trees with order constraints
Sebo, A
Waksman, Z
DISCRETE APPLIED MATHEMATICS, 1999, 91 (1-3) : 305 - 311
[49] Profile of Random Exponential Binary Trees
Yarong Feng
Hosam Mahmoud
Methodology and Computing in Applied Probability, 2018, 20 : 575 - 587
[50] On the generation of binary trees in A-order
Ahrabian, H
Nowzari-Dalini, A
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1999, 71 (03) : 351 - 357

← 1 2 3 4 5 →