Distinguishing threshold of graphs
From MaRDI portal
Publication:6074586
DOI10.1002/jgt.22923zbMath1522.05141arXiv2107.14767OpenAlexW3190914299MaRDI QIDQ6074586
Bahman Ahmadi, M. H. Shirdareh Haghighi, Mohammad Hadi Shekarriz, Unnamed Author
Publication date: 12 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.14767
Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Endomorphism breaking in graphs
- Distinguishing graphs by edge-colourings
- Distinguishing maps
- Number of distinguishing colorings and partitions
- The distinguishing chromatic number
- Using determining sets to distinguish Kneser graphs
- A note on the asymptotic and computational complexity of graph distinguishability
- The distinguishing number and distinguishing index of the lexicographic product of two graphs
- Automorphisms and regular embeddings of merged Johnson graphs
- The distinguishing number of the hypercube
- Symmetry breaking in graphs
- Bounds for distinguishing invariants of infinite graphs
- Distinguishing infinite graphs
- Distinguishing number of countable homogeneous relational structures
- The distinguishing number of Cartesian products of complete graphs
- Distinguishing labellings of group action on vector spaces and graphs
- Graph Theory
- Distinguishing graphs by total colourings
- Distinguishing partitions and asymmetric uniform hypergraphs
- Asymmetric trees with two prescribed degrees
- THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS
- The group of an X-join of graphs
- Linear Graphs of Degree ≤ 6 and their Groups
- Distinguishing Cartesian powers of graphs
- The structure of automorphism groups of Cayley graphs and maps.
This page was built for publication: Distinguishing threshold of graphs
