Sharif Digital Repository

A graph is called equimatchable if all of its maximal matchings have the same size. Kawarabayashi, Plummer, and Saito showed that the only connected equimatchable 3-regular graphs are K4 and K3, 3. We extend this result by showing that for an odd positive integer r, if G is a connected equimatchable r-regular graph, then G ϵ {Kr+1, Kr,r}. Also it is proved that for an even r, a connected triangle-free equimatchable r-regular graph is isomorphic to one of the graphs C5, C7, and Kr,r. © 2017 Wiley Periodicals, Inc  

Classification is the most important part of brain-computer interface (BCI) systems. Because the neural activities of different individuals are not identical, using the ordinary methods of subject-dependent classification, does not lead to high accuracy in betweensubject classification problems. As a result, in this study, we propose a novel method for classification that performs well in between-subject classification. In the proposed method, at first, the subject-dependent classifiers obtained from the train subjects are applied to the test trials to obtain a set of scores and labels for the trials. Using these scores and the real labels of the labeled test trials, linear regression is... 

Feature extraction and classification are the most important parts of BCI systems. The new branch of BCI studies focuses on the design of a classifier that is trained to function properly for each individual. This problem is known as Transfer Learning. In between-subject classification, due to the differences in the neural signals' distribution of different individuals, using the common methods of feature extraction for training the classifier, does not lead to high accuracy for the test subject. As a result, in this study, we present a method for extracting features that perform well in between subjects classifications. The data that we used in this study are EEG signals recorded during...