Results 11 to 20 of about 1,439,443 (264)
THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH [PDF]
Journal of Algebraic Systems, 2021 The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The minimum size of a label class in such a labeling of $G$ with $D(G) = d$ is
S. Alikhani, S. Soltani
doaj +1 more source
Distinguishing index of Kronecker product of two graphs
Electronic Journal of Graph Theory and Applications, 2021 The distinguishing index D'(G) of a graph G is the least integer d such that G has an edge labeling with d labels that is preserved only by a trivial automorphism. The Kronecker product G x H of two graphs G and H is the graph with vertex set V(G) x V(H)
Saeid Alikhani, Samaneh Soltani
doaj +1 more source
Distinguishing Number and Distinguishing Index of the Join of Two Graphs [PDF]
Mathematics Interdisciplinary Research, 2019 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. In this paper we study the distinguishing number and the
Saeid Alikhani, Samaneh Soltani
doaj +1 more source
The Distinguishing Chromatic Number [PDF]
The Electronic Journal of Combinatorics, 2006 In this paper we define and study the distinguishing chromatic number, $\chi_D(G)$, of a graph $G$, building on the work of Albertson and Collins who studied the distinguishing number. We find $\chi_D(G)$ for various families of graphs and characterize those graphs with $\chi_D(G)$ $ = |V(G)|$, and those trees with the maximum chromatic distingushing ...
Collins, Karen L., Trenk, Ann N.
openaire +2 more sources
On the local distinguishing chromatic number
AKCE International Journal of Graphs and Combinatorics, 2019 The distinguishing number of graphs is generalized in two directions by Cheng and Cowen (local distinguishing number) and Collins and Trenk (Distinguishing chromatic number). In this paper, we define and study the local distinguishing chromatic number of
Omid Khormali
doaj +2 more sources
The Distinguishing Numbers and the Distinguishing Indexes of Cayley Graphs
Journal of Applied and Industrial Mathematics, 2021 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. In this paper, we investigate the distinguishing number and the distinguishing index of Cayley graphs.
Alikhani, S., Soltani, S.
openaire +3 more sources
Equitable distinguishing chromatic number
Indian Journal of Pure and Applied Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tayyebeh Amouzegar, Kazem Khashyarmanesh
openaire +1 more source
Independent Exact Permutation Testing Algorithm for Distinguishing Sequential Pattern Discovery [PDF]
Jisuanji gongcheng, 2021 Traditional distinguishing sequential pattern mining algorithms usually generate a number of false positive patterns in their results, which hinder the subsequent decisions of tasks.
WU Jun, OUYANG Aijia, ZHANG Lin
doaj +1 more source
Distinguishing number and distinguishing index of certain graphs [PDF]
Filomat, 2017 The distinguishing number (index) D(G) (D0(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. In this paper we compute these two parameters for some specific graphs.
Alikhani, Saeid, Soltani, Samaneh
openaire +3 more sources
Number of distinguishing colorings and partitions [PDF]
Discrete Mathematics, 2020 A vertex coloring of a graph $G$ is called distinguishing (or symmetry breaking) if no non-identity automorphism of $G$ preserves it, and the distinguishing number, shown by $D(G)$, is the smallest number of colors required for such a coloring. This paper is about counting non-equivalent distinguishing colorings of graphs with $k$ colors.
Bahman Ahmadi +2 more
openaire +3 more sources