Trees with distinguishing number two

被引：1

作者：

Alikhani, Saeid ^{[1
]}

Soltani, Samaneh ^{[1
]}

机构：

[1] Yazd Univ, Dept Math, Yazd 89195741, Iran

来源：

AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2019年 / 16卷 / 03期

关键词：

Distinguishing number; Tree; Radius;

D O I：

10.1016/j.akcej.2018.02.001

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The distinguishing number D(G) of a graph G is the least integer d such that G has a vertex labeling with d labels that is preserved only by a trivial automorphism. In this paper we characterize all trees with radius at most three and distinguishing number two. Also we present a necessary condition for trees with distinguishing number two and radius more than three. (C) 2019 Kalasalingam University. Production and Hosting by Elsevier B.V.

引用

页码：280 / 283

页数：4

共 9 条

[1]

Albertson M., 1996, ELECTRON J COMB, V3, pR18

[2] SELF-CENTERED GRAPHS [J].