Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Karthik Ravi Shankar"'
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
CALDAM
A graph G is said to be k-distinguishable if every vertex of the graph can be colored from a set of k colors such that no non-trivial automorphism fixes every color class. The distinguishing number D(G) is the least integer k for which G is k-disting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d669700639ee03ae4f7fc9930fcc8a13
https://doi.org/10.1007/978-3-030-39219-2_20
https://doi.org/10.1007/978-3-030-39219-2_20
