Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
University of Regina Department of Mathematics and Statistics
 

Summary: COLLOQUIUM
University of Regina
Department of Mathematics and Statistics
Speaker: Ryan Tifenbach (University of Regina)
Title: Eigenvalues of strongly self-dual graphs
Time & Place: Friday, November 7, 3:30 - 4:30 pm, CL 232
Abstract
Let G be a graph with adjacency matrix M. The dual of G, denoted G+
,
is another graph whose adjacency matrix M+
satisfies
M+
= SM-1
S,
where S is a symmetric unitary matrix of a certain type. (Not every graph
possesses a dual.) The dual of a graph G is a type of graph-inverse, as it is
associated with the inverse of the adjacency matrix of G. If the graph G has
well-defined G+
and we also have G+ = G, we refer to G as self-dual. In a
previous session, we examined the combinatorial structure of such a graph.

  

Source: Argerami, Martin - Department of Mathematics and Statistics, University of Regina

 

Collections: Mathematics