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

A set of vertices S icluded in V (G) is (k, τ)-regular if it induces a k-regular subgraph of G such that | NG (v) ∩ S | = τ if v is not in S. Note that a connected graph with more than one edge has a perfect matching if and only if its line graph has a (0, 2)-regular set. In this paper, some spectra...

Full description

Bibliographic Details
Main Author: Cardoso, D.M. (author)
Other Authors: Rama, P. (author)
Format: article
Language:eng
Published: 1000
Subjects:
Adjacency matrix
Graph eigenvalues
Eigenvalues and eigenfunctions
Matrix algebra
Spectrum analysis
Combinatorial structure
Seidel switching
Graph theory
Online Access:http://hdl.handle.net/10773/4298
Country:Portugal
Oai:oai:ria.ua.pt:10773/4298

Internet

http://hdl.handle.net/10773/4298

Similar Items