Distinguishing chromatic number of middle and subdivision graphs

Abstract

Let $G$ be a simple finite connected graph of order $n$ greater than or equal to $3$. We obtain the following results: (1). We apply a result of Hamada and Yoshimura from 1976 and some recent results of Alikhani and Soltani (2020) and Kalinowski and Pilsniak (2015) to determine the distinguishing chromatic number of the middle graph $M(G)$ of the graph $G$. In particular, the distinguishing chromatic number $χ_{D}(M(G))$ of the middle graph $M(G)$ of the graph $G$ is $Δ(G)+1$ except for four small graphs $C_{4}, K_{4}, C_{6}$, and $K_{3,3}$, and $Δ(G)+2$ otherwise. (2). In 2016, Kalinowski, Pilsniak, and Wozniak introduced the total distinguishing number $D''(G)$ of $G$. Inspired by a recent result of Mirafzal (2024), we show that the distinguishing number $D(S(G))$ of the subdivision graph $S(G)$ of $G$ is $D''(G)$. Consequently, $D(S(G))$ is at most $\lceil \sqrt{Δ(G)}\rceil$. (3). We obtain a sharp upper bound for the distinguishing chromatic number of the subdivision graph $S(G)$ of $G$ in terms of the distinguishing number of $G$.

Figures (4)

• Figure 1: Graphs $Q, L(Q), C_{6}^{+}, K_{3,3}^{+}$, $C_{4}^{+},$ and $K_{4}^{+}$.
• Figure 2: Graph $G^{+}$.
• Figure 3: An edge coloring $c: E(K_{3,3}^{+}) \rightarrow \{1,..., \Delta(K_{3,3})+2\}$ of $K_{3,3}^{+}$.
• Figure 4: Graphs $S(G)$ and $G$.

Theorems & Definitions (33)

• Definition 2.1
• Definition 2.2
• Lemma 2.4
• proof
• Lemma 2.5
• proof
• Claim 2.6
• proof
• Claim 2.7
• proof