Spectral results on regular graphs with (k, τ)-regular sets

Discrete Mathematics

Volumn 307, Issue 11-12, 2007, Pages 1306-1316

  Cardoso, Domingos M ^a   Rama, Paula ^a  

^a UNIVERSITY OF AVEIRO   (Portugal)

Author keywords

Adjacency matrix; Graph eigenvalues

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; SET THEORY; SPECTRUM ANALYSIS;

ADJACENCY MATRIX; COMBINATORIAL STRUCTURE; GRAPH EIGENVALUES; SEIDEL SWITCHING;

GRAPH THEORY;

EID: 33947268632     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.11.068     Document Type: Article

References (18)

1. Barbosa R., and Cardoso D.M. On regular-stable graphs. Ars Combin. 70 (2004) 149-159
2. Cardoso D.M. Convex quadratic programming approach to the maximum matching problem. J. Global Optim. 21 (2001) 91-106
3. Cardoso D.M., and Rama P. Equitable bipartitions of graphs and related results. J. Math. Sci. 120 (2004) 869-880
4. Cvetković D., Doob M., and Sachs H. Spectra of Graphs (1979), Academic Press, New York
5. Cvetković D., Rowlinson P., and Simić S. Eigenspaces of Graphs (1997), Cambridge University Press, Cambridge
6. Doob M. A surprising property of the least eigenvalue of a graph. Linear Algebra Appl. 46 (1982) 1-7
7. Godsil C.D. Algebraic Combinatorics (1993), Chapman & Hall, New York
8. Halldórsson M.M., Kratochvíl J., and Telle J.A. Independent sets with domination constraints. Discrete Appl. Math. 99 (2000) 39-54
9. G. J. McKay, Backtrack programming and the graph isomorphism problem, M.Sc. Thesis, University of Melbourne, 1976.
10. Muzychuk M., and Klin M. On graphs with three eigenvalues. Discrete Math. 189 (1998) 191-207
11. Neumaier A. Regular sets and quasi-symmetric 2-designs. In: Jungnickel D., and Vedder K. (Eds). Combinatorial Theory (1982), Springer, Berlin 258-275
12. Powers D.L., and Sulaiman M.M. The walk partition and colorations of a graph. Linear Algebra Appl. 48 (1982) 145-159
13. Sachs H., and Über Teiler. Faktoren und Charakteristische Polynome von Graphen. Teil I. Wiss. Z. TH Ilmenau 12 (1966) 7-12
14. Sachs H., and Über Teiler. Faktoren und Charakteristische Polynome von Graphen. Teil II. Wiss. Z. TH Ilmenau 13 (1967) 405-412
15. Schwenk A.J. Computing the characteristic polynomial of a graph. In: Bari R., and Harary F. (Eds). Graphs and Combinatorics (1974), Springer, Berlin 153-172
16. J.J. Seidel, A survey of two-graphs, in: Proceedings of the International Colloquium on Teorie Combinatorie, Rome 1973, Atti Convegni. Lincei, Atti Accad. Naz. Lincei, Rome, 17 (1976) 481-511.
17. Stadler P.F., and Tinhofer G. Equitable partitions, coherent algebras and random walks: applications to the correlation structure of landscapes. MATCH Commun. Math. Comput. Chem. 40 (1999) 215-261
18. J.A. Telle, Characterization of domination-type parameters in graphs, in: Proceedings of the 24th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Congr. Numer. 94 (1993) 9-16.