Strongly self-dual graphs

被引:15
作者
Tifenbach, R. M. [1 ]
机构
[1] Natl Univ Ireland Maynooth, Hamilton Inst, Maynooth, Kildare, Ireland
关键词
Adjacency matrix; Dual graph; Inverse graph; Unique perfect matching;
D O I
10.1016/j.laa.2011.05.010
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We present a class of graphs whose adjacency matrices are nonsingular with integral inverses, denoted h-graphs. lithe h-graphs G and H with adjacency matrices M(G) and M(H) satisfy M(G)(-1) = SM(H)S, where S is a signature matrix, we refer to H as the dual of G. The dual is a type of graph inverse. If the h-graph G is isomorphic to its dual via a particular isomorphism, we refer to G as strongly self-dual. We investigate the structural and spectral properties of strongly self-dual graphs, with a particular emphasis on identifying when such a graph has 1 as an eigenvalue. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:3151 / 3167
页数:17
相关论文
共 11 条
[1]   On unimodular graphs [J].
Akbari, S. ;
Kirkland, S. J. .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2007, 421 (01) :3-15
[2]  
[Anonymous], 1978, U BEOGRAD PUBL EL MZ
[3]   The spectrum of the corona of two graphs [J].
Barik, S. ;
Pati, S. ;
Sarma, B. K. .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (01) :47-56
[4]   On nonsingular trees and a reciprocal eigenvalue property [J].
Barik, S. ;
Neumann, M. ;
Pati, S. .
LINEAR & MULTILINEAR ALGEBRA, 2006, 54 (06) :453-465
[5]   ON GRAPHS WITH SIGNED INVERSES [J].
BUCKLEY, F ;
DOTY, LL ;
HARARY, F .
NETWORKS, 1988, 18 (03) :151-157
[6]   INVERSES OF TREES [J].
GODSIL, CD .
COMBINATORICA, 1985, 5 (01) :33-39
[7]  
LOWE JP, 2006, PETERSON QUANTUM CHE
[8]   SOLUTION TO A PROBLEM OF CD GODSIL REGARDING BIPARTITE GRAPHS WITH UNIQUE PERFECT MATCHING [J].
SIMION, R ;
CAO, DS .
COMBINATORICA, 1989, 9 (01) :85-89
[9]  
TIFENBACH R, 2008, THESIS U REGINA
[10]   Directed intervals and the dual of a graph [J].
Tifenbach, R. M. ;
Kirkland, S. J. .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2009, 431 (5-7) :792-807