Results 1 to 6 of about 20 (6)

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, Klavžar Sandi, Lehner Florian, Soltani Samaneh   +3 more
doaj   +1 more source

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   +1 more source

Homogeneous isosceles-free spaces. [PDF]

Rev R Acad Cienc Exactas Fis Nat A Mat
Bargetz C, Bartoš A, Kubiś W, Luggin F.   +3 more
europepmc   +1 more source

Some rigid moieties of homogeneous graphs [PDF]

, 2012
Any countable Kn-free graph T embeds as a moiety into the universal homogeneous Kn-free graph Kn in such a way that every automorphism of T extends into a unique automorphism of Kn.
Bilge, Dogan, Jaligot, Eric
core   +3 more sources

Distinguishing number and distinguishing index of neighbourhood corona of two graphs [PDF]

, 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.
Alikhani, Saeid, Soltani, Samaneh
core   +2 more sources

International Journal of Mathematical Combinatorics, Vol.7 [PDF]

, 2013
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core   +1 more source