Results 1 to 10 of about 21 (21)
Trees with Distinguishing Index Equal Distinguishing Number Plus One
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 +1 more source
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
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 +1 more source
Homogeneous isosceles-free spaces. [PDF]
Bargetz C +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Distinguishing critical graphs
Journal of Information and Optimization Sciences, 2021Saeid Alikhani, Samaneh Soltani
exaly
Theorems of Carathéodory, Minkowski–Weyl, and Gordan up to Symmetry
SIAM Journal on Applied Algebra and Geometry, 2023Tim Romer, Dinh Van Le
exaly
Modulation in tetradic harmony and its role in jazz
Journal of Mathematics and Music, 2020Octavio A Agustín-Aquino +1 more
exaly
Minuscule Doppelgängers, The Coincidental down-Degree Expectations Property, and Rowmotion
Experimental Mathematics, 2022Sam Hopkins
exaly
Commuting involution graphs in classical affine Weyl groups
Communications in Algebra, 2020Sarah Hart
exaly
On the involutions of the Riordan group
Functiones Et Approximatio, Commentarii Mathematici, 2016Masanari Kida
exaly
Distinguishing number and distinguishing index of some operations on graphs
Journal of Information and Optimization Sciences, 2018Saeid Alikhani, Samaneh Soltani
exaly

