On induced matchings as star complements in regular graphs
- 31 Downloads
We determine all the finite regular graphs which have an induced matching or a cocktail party graph as a star complement.
KeywordsAdjacency Matrix Regular Graph Complete Bipartite Graph Petersen Graph Graph Spectrum
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 2.F. C. Bussemaker, D. Cvetković, and J. J. Seidel, Graphs Related to Exceptional Root Systems, T. H. Report 76-WSK-05, Technological University of Eindhoven (1976).Google Scholar
- 5.D. Cvetković, P. Rowlinson, and S. K. Simić, An Introduction to the Theory of Graph Spectra, Cambridge Univ. Press, Cambridge (2009).Google Scholar
- 6.A. Neumaier, “Regular sets and quasi-symmetric 2-designs,” in: Lect. Notes Math., 969, Springer-Verlag, Berlin (1982), pp. 258–275.Google Scholar
- 10.D. Stevanović (ed.), “Research problems from the Aveiro workshop on graph spectra,” Linear Algebra Appl. 423, 172–181 (2007).Google Scholar
© Springer Science+Business Media, Inc. 2012