Results 251 to 260 of about 445,292 (276)

The distinguishing number of the augmented cube and hypercube powers [PDF]

Discrete Mathematics, 2008
The distinguishing number of a graph G, denoted D(G), is the minimum number of colors such that there exists a coloring of the vertices of G where no nontrivial graph automorphism is color-preserving.
Melody Chan
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

The distinguishing number and the distinguishing index of graphs from primary subgraphs

2019
Summary: The distinguishing number (index) \(D(G)\) \((D'(G))\) of a graph \(G\) is the least integer \(d\) such that \(G\) has an vertex labeling (edge labeling) with \(d\) labels that is preserved only by a trivial automorphism. Let \(G\) be a connected graph constructed from pairwise disjoint connected graphs \(G_1,\dots,G_k\) by selecting a vertex ...
Alikhani, Saeid, Soltani, Samaneh
openaire   +1 more source