Results 11 to 20 of about 445,292 (276)
Trees with Distinguishing Index Equal Distinguishing Number Plus One [PDF]
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 +7 more sources
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs [PDF]
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 +4 more sources
On the Distance Pattern Distinguishing Number of a Graph [PDF]
Journal of Applied Mathematics, 2014 Let G=(V,E) be a connected simple graph and let M be a nonempty subset of V. The M-distance pattern of a vertex u in G is the set of all distances from u to the vertices in M.
Sona Jose, Germina K. Augustine
doaj +6 more sources
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 +5 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
Distinguishing numbers and distinguishing indices of oriented graphs
Discrete Applied Mathematics, 2020 A distinguishing r-vertex-labelling (resp. r-edge-labelling) of an undirected graph G is a mapping $λ$ from the set of vertices (resp. the set of edges) of G to the set of labels {1,. .. , r} such that no non-trivial automorphism of G preserves all the vertex (resp. edge) labels.
Eric Sopena
exaly +5 more sources
A New Game Invariant of Graphs: the Game Distinguishing Number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 The distinguishing number of a graph $G$ is a symmetry related graph invariant whose study started two decades ago. The distinguishing number $D(G)$ is the least integer $d$ such that $G$ has a $d$-distinguishing coloring.
Sylvain Gravier +3 more
doaj +3 more sources
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 +2 more sources
The distinguishing number and the distinguishing index of co-normal product of two graphs [PDF]
Ratio Mathematica, 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.
Saeid Alikhani, Samaneh Soltani
doaj +3 more sources
Distinguishing number and distinguishing index of neighbourhood corona of two graphs [PDF]
Contributions to Discrete Mathematics, 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. The neighbourhood corona of two graphs $G_1$ and $G_2$ is denoted by $G_1 \star G_2$ and is the graph obtained by taking one copy of ...
Alikhani, Saeid, Soltani, Samaneh
core +7 more sources