Distinguishing number and distinguishing index of graphs from primary subgraphs

preprint2016arXivOpen access

Abstract

The distinguishing number (index) D(G)D(G) (D′(G)D'(G)) of a graph GG is the least integer dd such that GG has an vertex labeling (edge labeling) with dd labels that is preserved only by a trivial automorphism. Let GG be a connected graph constructed from pairwise disjoint connected graphs G1,…,GkG_1,\ldots ,G_k by selecting a vertex of G1G_1, a vertex of G2G_2, and identify these two vertices. Then continue in this manner inductively. We say that GG is obtained by point-attaching from G1,…,GkG_1, \ldots ,G_k and that GiG_i's are the primary subgraphs of GG. In this paper, we consider some particular cases of these graphs that are of importance in chemistry and study their distinguishing number and index.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.