Results 11 to 20 of about 402,994 (257)
On the graphs with distinguishing number equal list distinguishing number [PDF]
Journal of Mahani Mathematical Research, 2023 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 the trivial automorphism.
Saeid Alikhani, Samaneh Soltani
doaj +3 more sources
Trees with Distinguishing Index Equal Distinguishing Number Plus One
Discussiones Mathematicae Graph Theory, 2020 The distinguishing number (index) D(G) (D′ (G)) of a graph G is the least integer d such that G has an vertex (edge) labeling with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid +3 more
doaj +4 more sources
The list Distinguishing Number Equals the Distinguishing Number for Interval Graphs
Discussiones Mathematicae Graph Theory, 2017 A distinguishing coloring of a graph G is a coloring of the vertices so that every nontrivial automorphism of G maps some vertex to a vertex with a different color. The distinguishing number of G is the minimum k such that G has a distinguishing coloring
Immel Poppy, Wenger Paul S.
doaj +4 more sources
Trees with distinguishing number two [PDF]
AKCE International Journal of Graphs and Combinatorics, 2019 The distinguishing number of a graph is the least integer such that has a vertex labeling with labels that is preserved only by a trivial automorphism. In this paper we characterize all trees with radius at most three and distinguishing number two.
Saeid Alikhani, Samaneh Soltani
doaj +4 more sources
پژوهشهای ریاضی, 2020 Introduction The graph is a mathematical model for a discrete set whose members are interlinked in some way. The members of this collection can be the different parts of the earth and the connections between them are bridges that tie them together (like ...
Saeid Alikhani, Samaneh Soltani
doaj +2 more sources
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
Discussiones Mathematicae Graph Theory, 2018 The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid, Soltani Samaneh
doaj +3 more sources
The distinguishing number and the distinguishing index of line and graphoidal graph(s)
AKCE International Journal of Graphs and Combinatorics, 2020 The distinguishing number (index) () of a graph is the least integer such that has a vertex labeling (edge labeling) with labels that is preserved only by a trivial automorphism.
Saeid Alikhani, Samaneh Soltani
doaj +3 more sources
The Distinguishing Number and Distinguishing Chromatic Number for Posets [PDF]
Order, 2021 23 pages, 4 ...
Karen L. Collins, Ann N. Trenk
openaire +3 more sources
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