Distinguishing Infinite Graphs (original) (raw)

3 Bounding the Distinguishing Number of Infinite Graphs

Mark Watkins

2016

View PDFchevron_right

Bounding the distinguishing number of infinite graphs

Mark Watkins

arXiv: Combinatorics, 2013

View PDFchevron_right

1902 Distinguishing Cartesian Products of Countable Graphs

Wilfried Imrich

2016

View PDFchevron_right

Distinguishing Cartesian products of countable graphs

Ehsan Estaji

Discussiones Mathematicae Graph Theory, 2017

View PDFchevron_right

Bounding the distinguishing number of infinite graphs (with Mark Watkins)

Simon Smith, Mark Watkins

View PDFchevron_right

Bounding the Distinguishing Number of Infinite Graphs and Permutation Groups

Mark Watkins

The Electronic Journal of Combinatorics

View PDFchevron_right

Distinguishability of infinite groups and graphs

Mark Watkins

2011

View PDFchevron_right

The distinguishing number of Cartesian products of complete graphs

Wilfried Imrich

European Journal of Combinatorics, 2008

View PDFchevron_right

The distinguishing index of the Cartesian product of finite graphs

Aleksandra Gorzkowska

Ars Mathematica Contemporanea, 2016

View PDFchevron_right

A note on the asymptotics and computational complexity of graph distinguishability

Ravi Sundaram

Electronic Journal of Combinatorics, 1998

View PDFchevron_right

The distinguishing number and distinguishing index of the lexicographic product of two graphs

Saeid Alikhani

Discussiones Mathematicae Graph Theory

View PDFchevron_right

Notes on the independence number in the Cartesian product of graphs

Ghidewon Abay-Asmerom

Discussiones Mathematicae Graph Theory, 2011

View PDFchevron_right

On the order of countable graphs

Jaroslav Nešetřil

European Journal of Combinatorics, 2003

View PDFchevron_right

Edge-Magic Group Labellings of Countable Graphs

adrian nelson

The Electronic Journal of Combinatorics, 2006

View PDFchevron_right

Distinguishability of Locally Finite Trees

Mark Watkins

The Electronic Journal of Combinatorics

View PDFchevron_right

Infinite Motion and 2-Distinguishability of Graphs and Groups

Mark Watkins

2013

View PDFchevron_right

Bounds for Distinguishing Invariants of Infinite Graphs

Wilfried Imrich

The Electronic Journal of Combinatorics, 2017

View PDFchevron_right

The Cost of Edge-distinguishing of the Cartesian Product of Connected Graphs

Aleksandra Gorzkowska

arXiv: Combinatorics, 2019

View PDFchevron_right

Distinguishing number and distinguishing index of lexicographic product of two graphs

Saeid Alikhani

Cornell University - arXiv, 2016

View PDFchevron_right

On the determining number and the metric dimension of graphs

Ricardo Caceres

The Electronic Journal of Combinatorics, 2010

View PDFchevron_right

On the metric dimension of infinite graphs

Ignacio M Pelayo

Discrete Applied Mathematics, 2012

View PDFchevron_right

Distinguishing numbers of Cartesian products of multiple complete graphs

Garth Isaak

ARS MATHEMATICA CONTEMPORANEA, 2011

View PDFchevron_right

Characterization of graphs with distinguishing number equal list distinguishing number

Saeid Alikhani

arXiv: Combinatorics, 2017

View PDFchevron_right

Distinguishing Cartesian powers of graphs

Wilfried Imrich

Journal of Graph Theory, 2006

View PDFchevron_right

Distinguishing number and distinguishing index of certain graphs

Saeid Alikhani

Filomat

View PDFchevron_right

The n -ordered graphs: A new graph class

C. Wang, Jeannette Janssen

Journal of Graph Theory, 2009

View PDFchevron_right