Results 1 to 10 of about 5,516,987 (160)
The distinguishing number and the distinguishing index of line and graphoidal graph(s) [PDF]
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 +5 more sources
The chromatic distinguishing index of certain graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 The distinguishing index of a graph , denoted by , is the least number of labels in an edge coloring of not preserved by any non-trivial automorphism. The distinguishing chromatic index of a graph is the least number such that has a proper edge coloring ...
Saeid Alikhani, Samaneh Soltani
doaj +6 more sources
Distinguishing index of Kronecker product of two graphs [PDF]
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 +3 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
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 +5 more sources
Edge motion and the distinguishing index
Theoretical Computer Science, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Monika Pilśniak
exaly +4 more sources
A Note on Neighbor Expanded Sum Distinguishing Index
Discussiones Mathematicae Graph Theory, 2017 A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set [k] = {1, . . . , k}. These colors can be used to distinguish the vertices of G. There are many possibilities of such a distinction.
Flandrin Evelyne +4 more
doaj +4 more sources
Precise bounds for the distinguishing index of the Cartesian product
Theoretical Computer Science, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandra Gorzkowska +1 more
exaly +3 more sources
Some bounds on the neighbor-distinguishing index of graphs
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weifan Wang +2 more
exaly +3 more sources
Neighbor sum distinguishing index of planar graphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhumin Chen
exaly +4 more sources