Abstract
The distinguishing number (index) () of a graph is the least integer such that has an vertex labeling (edge labeling) with labels that is preserved only by a trivial automorphism. Let be a connected graph constructed from pairwise disjoint connected graphs by selecting a vertex of , a vertex of , and identify these two vertices. Then continue in this manner inductively. We say that is obtained by point-attaching from and that 's are the primary subgraphs of . In this paper, we consider some particular cases of these graphs that are of importance in chemistry and study their distinguishing number and index.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.