The distinguishing number and the distinguishing index of line and graphoidal graphs

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. A graphoidal cover of $G$ is a collection $\psi$ of (not necessarily open) paths in $G$ such that every path in $\psi$ has at least two vertices, every vertex of $G$ is an internal vertex of at most one path in $\psi$ and every edge of $G$ is in exactly one path in $\psi$. Let $\Omega(G,\psi)$ denote the intersection graph of $\psi$. A graph $H$ is called a graphoidal graph, if there exists a graph $G$ and a graphoidal cover $\psi$ of $G$ such that $H\cong \Omega (G, \psi)$. In this paper, we study the distinguishing number and the distinguishing index of the line graph and the graphoidal graph of a simple connected graph $G$.


Introduction and definitions
Let G = (V, E) be a simple, finite, connected and undirected graph, and let Aut(G) be its automorphism group. A labeling of G, φ : V → {1, 2, . . . , r}, is said to be rdistinguishing, if no non-trivial automorphism of G preserves all of the vertex labels. The point of the labels on the vertices is to destroy the symmetries of the graph, that is, to make the automorphism group of the labeled graph trivial. Formally, φ is r-distinguishing if for every non-identity σ ∈ Aut(G), there exists x in V such that φ(x) = φ(σ(x)). The distinguishing number of a graph G is defined by D(G) = min{r| G has a labeling that is r-distinguishing}.
This number has defined in [1]. Similar to this definition, in [7] the distinguishing index D ′ (G) of G, which is the least integer d such that G has an edge colouring with d colours that is preserved only by a trivial automorphism, has been defined. D ′ (G) can be arbitrary smaller than D(G), for example D ′ (K p,p ) = 2 and D(K p,p ) = p + 1, for p ≥ 4.
The line graph L(G) of a graph G is the graph whose vertices are edges of G and two edges e, e ′ ∈ V (L(G)) = E(G) are adjacent if they share an endpoint in common. The line graphs can be viewed a special case of graphoidal graphs. The concept of graphoidal cover was introduced by Acharya and Sampathkumar [2]. Definition 1.1 [2] A graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths in G satisfying the following conditions: (i) Every path in ψ has at least two vertices.
(ii) Every vertex of G is an internal vertex of at most one path in ψ.
(iii) Every edge of G is in exactly one path in ψ.
. . , S n } is a family of distinct nonempty subsets of a set S, whose union is S, then the intersection graph of F , denoted by Ω(F ), is the graph whose vertex set and edge set are given by Let G G be the set of all graphoidal covers of G and ψ ∈ G G . The intersection graph on ψ is denoted by Ω(G, ψ). A graph H is called a graphoidal graph if there exists a graph G and ψ ∈ G G such that H ∼ = Ω(G, ψ). Since E(G) is obviously a graphoidal cover of G, all line graphs are graphoidal graphs. In [2] Acharya and Sampathkumar have proved that all the Beineke's forbidden subgraphs of line graphs (see Figure 1) are graphoidal graphs and hence they conjectured that all graphs are graphoidal. In [4] Arumugam and Pakkiam disproved this conjecture by showing that complete bipartite graphs K m,n with mn > 2(m + n) are not graphoidal graphs. They also obtained a forbidden subgraph characterization of all bipartite graphs which are graphoidal. Note that if P = (v 0 , v 1 , . . . , v k ) is a path, not necessarily open, in a graph G, then v 0 and v k are called terminal vertices and v 1 , . . . , v k−1 are called internal vertices of P . For cycles (considered as closed paths), there is an inherent ordering of vertices as in paths. So, when we say that a cycle C of a graph G is a member of a graphoidal cover ψ of G, we should mention the vertex at which the cycle C begins, and this particular vertex is considered as the terminal vertex of C and all other vertices on C are called internal vertices of C. Given a graphoidal cover ψ of G, a vertex v is said to be interior to ψ if v is an internal vertex of an element of ψ and is called exterior to ψ otherwise.
In the next section, we study the distinguishing number and the distinguishing index of line graphs. In Section 3, we consider graphoidal graphs and study their distinguishing number and distinguishing index.     (iv) None of the nine graphs in Figure 1 is an induced subgraph of G.
To study the distinguishing number and the distinguishing index of L(G), we need more information about the automorphism group of L(G). Let γ G : Aut(G) → Aut(L(G)) be given by ( In [11], Sabidussi proved the following Theorem which we need it later. Theorem 2.2 [11] Suppose that G is a connected graph that is not P 2 , Q, or L(Q) (see Figure 2). Then G is a group isomorphism, and so Aut(G) ∼ = Aut(L(G)). Now we are ready to obtain the distinguishing number of line graph of a graph. We note that if G = L(Q), then it is easy to see that D ′ (L(Q)) = 2, while D(L(L(Q))) = 3.

Theorem 2.3
Suppose that G is a connected graph that is not P 2 and L(Q). Then D(L(G)) = D ′ (G).
, because if f is an automorphism of L(G) preserving the labeling, then c ′ (f (e)) = c ′ (e), and hence c(f (e)) = c(e) for any e ∈ E(G). On the other hand, by Theorem . This means that φ is an automorphism of G preserving the labeling c, and so φ is the identity automorphism of G. Therefore f is the identity automorphism of L(G), and hence D(L(G)) ≤ D ′ (G). For the converse, suppose that which means that γ G f preserves the distinguishing vertex labeling of L(G), and hence γ G f is the identity automorphism of L(G). Therefore f is the identity automorphism of G, and so D ′ (G) ≤ D(L(G)).
An upper bound for the distinguishing index of line graphs follows immediately from the following result of Pilśniak in [9]. A K 1,3 -free graph, called also a claw-free graph, is a graph containing no copy of K 1,3 as an induced subgraph.

Study of D(G) and D ′ (G) for graphoidal graphs
We recall that a graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths in G satisfying the following conditions: every path in ψ has at least two Proof. Let G be a graph as shown in Figure 3. It is easy to see that D Thus Ω(G, ψ) = K 1,n , and hence D(Ω(G, ψ)) = D ′ (Ω(G, ψ)) = n. Therefore we have the result.
To study the distinguishing index of graphoidal graphs, we need some theorems.

Theorem 3.2 [7]
If G is a connected graph of order n ≥ 3, then D ′ (G) ≤ ∆(G), unless G is C 3 , C 4 or C 5 .

Theorem 3.4 [6] If T is a tree of order n ≥ 3, then D(T ) ≤ ∆(T ). Furthermore, equality is achieved if and only if T is a symmetric tree or a path of odd length.
Before we state the next theorem we need to define some terms: Let v be a vertex of a graph G and let f be a k-distinguishing edge labeling of G. We say that f is v-distinguishing if f is preserved only by the trivial automorphism among the automorphisms α ∈ Aut(G) for which α(v) = v holds. If vw is an edge of a tree T , then let T v and T w be the components of T −{vw} with v ∈ T v and w ∈ T w . A family T consists of those trees T of order at least 3, for which the following conditions are fulfilled: (1) T is a bicentric tree with the central edge e = vw, (2) T v and T w are isomorphic trees, (3) T v admits a unique v-distinguishing edge D(T )-labeling.
In sequel, we gives bounds for the distinguishing number of the graphoidal graphs. Theorem 3.8 Let G be a connected graph of order n ≥ 3. Then Proof.
Since Ω(G, ψ) has |ψ| vertices, so it is clear that D(Ω(G, ψ)) ≤ |ψ|. To prove the left inequality, let D(Ω(G, ψ)) = t and X i = {P i1 , . . . , P is i }, 1 ≤ i ≤ t be the set of vertices of Ω(G, ψ) having label i in the distinguishing labeling of Ω(G, ψ). Now we want to label the edges of G distinguishingly, using t + 2 labels. For this purpose, for every i, 1 ≤ i ≤ t, we label the edge set of all paths of ψ (not necessarily open) in X i of length j with j-tuple (i, t + 1, t + 2, . . . , t + 2 (j−2)−times ) of labels. We note that since there exist the closed paths (cycles) in ψ, so we need at most three different labels to distinguishing these closed paths. Then we have an edge labeling of G with t + 2 labels. To show that this edge labeling is distinguishing, we prove that if f is an automorphism of G preserving this edge labeling, then f maps ψ to ψ, setwise. In fact, if P ∈ ψ, then f (P ) is a path of the same length as P . Since f preserves the edge labeling of G, so the label of edges of f (P ) is the same as edges of P . With respect to the method of lebeling of edge set of each path in ψ, we conclude that f (P ) ∈ ψ. Hence f maps a path in ψ to a path in ψ. Thus f can be considered as an automorphism of Ω(G, ψ) preserves the distinguishing vertex labeling of Ω(G, ψ) with t labels. Thus f is the identity automorphism of Ω(G, ψ), and this means that f (P ) = P for all P ∈ ψ. On the other hand, since we labeled the edge set of each path in ψ distinguishingly with at most three labels, so f fixes all vertices of path P , where P ∈ ψ. Thus f is the identity automorphism of G.
The bounds of Theorem 3.8 are sharp. For the left inequality, it is sufficient to consider G = C i , 3 ≤ i ≤ 5, and ψ = {C i }. Thus Ω(G, ψ) = K 1 , and hence D ′ (G) = 3 and D(Ω(G, ψ)) = 1. To show that the upper bound of this theorem is sharp, we consider G = C 3 and ψ = {e 1 , e 2 , e 3 }. Thus Ω(G, ψ) = C 3 , and hence |ψ| = 3 and D(Ω(G, ψ)) = 3. Proof. The proof is exactly the same as proof of Theorem 3.8, except the method of labeling of edges of paths in ψ. Since all paths in ψ are open, then by notation of Theorem 3.8, for every i, 1 ≤ i ≤ t, we label the edge set of all open paths of ψ in X i of length j with the j-tuple (i, t + 1, . . . , t + 1 (j−1)−times ) of labels. Then we have an edge labeling of G with t + 1 labels. To show this edge labeling is distinguishing, we prove that if f is an automorphism of G preserving this edge labeling, then f maps ψ to ψ setwise. In fact, if P ∈ ψ, then f (P ) is a path of the same length as P . Since f preserves the edge labeling of G, so the label of edges of f (P ) is the same as edges of P . With respect to the method of lebeling of edge set of each path in ψ, we conclude that f (P ) ∈ ψ. Hence f maps a path in ψ to a path in ψ. Thus f can be considered as an automorphism of Ω(G, ψ) preserves the distinguishing vertex labeling of Ω(G, ψ) with t labels. Thus f is the identity automorphism of Ω(G, ψ), and this means that f (P ) = P for all P ∈ ψ. On the other hand, since we labeled the edge set of each path in ψ distinguishingly with at most two labels, so f fixes all vertices of path P where P ∈ ψ. Thus f is the identity automorphism of G.
We conclude the paper with the following theorem, which shows that the value |D ′ (G) − D(Ω(G, ψ))| can be arbitrary. Proof. Let G and Ω(G, ψ) be the two graphs of Theorem 3.7. Since the automorphism group of G has at most one nonidentity automorphism, so D ′ (G) ≤ 2. On the other hand Ω(G, ψ) is a tree with a central vertex, and so D(Ω(G, ψ)) = D ′ (Ω(G, ψ)) = ⌈ p √ x⌉, by Theorem 3.5. Now, with respect to the values of x and p, we obtain the result.