Tokyo Journal of Mathematics

Some Results on Walk Regular Graphs Which Are Cospectral to Its Complement

Mirko LEPOVIĆ
Source: Tokyo J. of Math. Volume 33, Number 1 (2010), 223-234.

Abstract

We say that a regular graph $G$ of order $n$ and degree $r\ge 1$ (which is not the complete graph) is strongly regular if there exist non-negative integers $\tau$ and $\theta$ such that $|S_i\cap S_j| = \tau$ for any two adjacent vertices $i$ and $j$, and $|S_i\cap S_j| = \theta$ for any two distinct non-adjacent vertices $i$ and $j$, where $S_k$ denotes the neighborhood of the vertex $k$. We say that a graph $G$ of order $n$ is walk regular if and only if its vertex deleted subgraphs $G_i = G\smallsetminus i$ are cospectral for $i = 1,2,\ldots ,n$. We here establish necessary and sufficient conditions under which a walk regular graph $G$ which is cospectral to its complement $\overline G$ is strongly regular.

First Page: Show Hide
Primary Subjects: 05C50
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.tjm/1279719588
Digital Object Identifier: doi:10.3836/tjm/1279719588
Mathematical Reviews number (MathSciNet): MR2682891

References

R. J. Elzinga,Strongly regular graphs: values of $\lambda$ and $\mu$ for which there are only finitely many feasible $(v,k,\lambda, \mu)$, Electronic Journal of Linear Algebra ISSN 1081--3810, A publication of the International Linear Algebra Society, Volume 10, pp. 232--239, October, 2003.
Mathematical Reviews (MathSciNet): MR2025006
Zentralblatt MATH: 1033.05101
M. Lepović, On spectral complementary graphs, J. Math. (Novi Sad), 30, No. 3 (2000), 83--91.
Mathematical Reviews (MathSciNet): MR1776447
M. Lepović, On conjugate adjacency matrices of a graph, Discrete Math., 307 (2007), 730--738.
Mathematical Reviews (MathSciNet): MR2291448
Zentralblatt MATH: 1119.05068
Digital Object Identifier: doi:10.1016/j.disc.2006.07.030
M. Lepović, The conjugate formal product of a graph, Applicable Analysis and Discrete Mathematics, 1 (2007), 427--437.
Mathematical Reviews (MathSciNet): MR2355284
Zentralblatt MATH: 05642192
Digital Object Identifier: doi:10.2298/AADM0702427L
M. Lepović, On conjugate characteristic polynomial of a graph, J. Appl. Math. and Computing, 28 (2008), 473--483. DOI:10.1007/s12190-008-0120-x
Mathematical Reviews (MathSciNet): MR2430952
Zentralblatt MATH: 1171.05034
Digital Object Identifier: doi:10.1007/s12190-008-0120-x
M. Lepović, Some results on walk regular and strongly regular graphs, New Zealand Journal of Mathematics, 38 (2008), 161--169.
Mathematical Reviews (MathSciNet): MR2511093
Zentralblatt MATH: 05676626
M. Lepović, The conjugate characteristic polynomial of some compound graphs, International Journal of Computer Mathematics, in, press

2013 © Publication Committee for the Tokyo Journal of Mathematics

Tokyo Journal of Mathematics

Tokyo Journal of Mathematics

Turn MathJax Off
What is MathJax?