Abstract:Let G be a simple, finite, connected, and undirected graph. The middle graph M(G) of G is obtained from the subdivision graph S(G) after joining pairs of subdivided vertices that lie on adjacent edges of G and the central graph C(G) of G is obtained from S(G) after joining all non-adjacent vertices of G.
We show that if the order of G is at least 4, then Aut(G), Aut(C(G)), and Aut(M(G)) are isomorphic (as abstract groups) and apply this result to obtain new upper bounds of the distinguishing number and the distinguishing index of C(G) and M(G) and provide examples showing that these bounds cannot be improved in general.
Moreover, we use idempotent commutative Latin squares and a theorem of Galvin on list edge colorings of bipartite graphs to study the total distinguishing chromatic number of central graphs.
From: Amitayu Banerjee [view email]
[v1]
Tue, 22 Jul 2025 07:39:10 UTC (26 KB)
[v2]
Wed, 8 Apr 2026 09:17:48 UTC (16 KB)
[v3]
Tue, 16 Jun 2026 07:15:10 UTC (20 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。