On the domination number of permutation graphs and an application to strong fixed points

A permutation graphGπ is a simple graph with vertices corresponding to the elements of π and an edge between i and j when i and j are inverted in π. A set of vertices D is said to dominate a graph G when every vertex in G is either an element of D, or adjacent to an element of D. The domination numb...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2021-01, Vol.288, p.20-34
Hauptverfasser:	Baren, Theresa, Cory, Michael, Friedberg, Mia, Gardner, Peter, Hammer, James, Harrington, Joshua, McGinnis, Daniel, Waechter, Riley, Wong, Tony W.H.
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Graph domination Graph theory Graphs Permutation graphs Permutations Strong fixed points
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!