The distinguishing numbers of merged Johnson graphs
Dongseok Kim, Young Soo Kwon, Jaeun Lee
TL;DR
This paper determines the distinguishing number of merged Johnson graphs, a generalization of Kneser and Johnson graphs, contributing to graph symmetry and automorphism studies.
Contribution
It provides the first explicit calculation of the distinguishing number for merged Johnson graphs, expanding understanding of their symmetry properties.
Findings
Calculated the distinguishing number for various merged Johnson graphs.
Extended known results from Johnson and Kneser graphs to a broader class.
Enhanced understanding of automorphism groups of merged Johnson graphs.
Abstract
In present article, we determine the distinguishing number of the merged Johnson graphs which are generalization of both the Kneser graphs and of the Johnson graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Photochromic and Fluorescence Chemistry · Synthesis of Indole Derivatives