Results 231 to 240 of about 918,355 (267)
Some of the next articles are maybe not open access.
1974
It is often useful to ask of a point in the spectrum of an operator how it got there. To say that A is in the spectrum of A means that A — λ is not invertible. The question reduces therefore to this: why is a non-invertible operator not invertible?
openaire +1 more source
It is often useful to ask of a point in the spectrum of an operator how it got there. To say that A is in the spectrum of A means that A — λ is not invertible. The question reduces therefore to this: why is a non-invertible operator not invertible?
openaire +1 more source
2012
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association schemes, p-ranks of configurations and similar topics ...
Brouwer, A.E., Haemers, W.H.
openaire +2 more sources
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association schemes, p-ranks of configurations and similar topics ...
Brouwer, A.E., Haemers, W.H.
openaire +2 more sources
1974
The time has come to consider special cases. The first result is that for normal operators, the most amenable large class known, the worst spectral pathology cannot occur.
openaire +1 more source
The time has come to consider special cases. The first result is that for normal operators, the most amenable large class known, the worst spectral pathology cannot occur.
openaire +1 more source
Australas. J Comb., 2002
The author gives examples showing that no two of the three usual graph spectra (adjacency, Laplacian, Seidel) suffice to compute the third one in case of non-regular graphs. Further, examples are given to show that these three spectra taken together do not suffice to compute exactly the max-cut and the bisection of a graph.
openaire +2 more sources
The author gives examples showing that no two of the three usual graph spectra (adjacency, Laplacian, Seidel) suffice to compute the third one in case of non-regular graphs. Further, examples are given to show that these three spectra taken together do not suffice to compute exactly the max-cut and the bisection of a graph.
openaire +2 more sources
2005
The k-spectrum of a word is the multiset of its non-contiguous subwords of length k. For given k, how small can n be for a pair of different words of length n to exist, with equal k- spectra? From the Thue-Morse word we find that n is at most 2k. The construction of this paper decreases this upper bound to θk, where $\bumpeq$ is the golden ratio; the ...
openaire +1 more source
The k-spectrum of a word is the multiset of its non-contiguous subwords of length k. For given k, how small can n be for a pair of different words of length n to exist, with equal k- spectra? From the Thue-Morse word we find that n is at most 2k. The construction of this paper decreases this upper bound to θk, where $\bumpeq$ is the golden ratio; the ...
openaire +1 more source
Australas. J Comb., 2022
Summary: The purpose of this paper is to introduce a model to study structures which are widely present in public transportation networks. We show that, through hypergraphs, one can describe these structures and investigate the relation between their spectra. To this aim, we extend the structure of \((m,k)\)-stars on graphs to hypergraphs: the \((m,k)\)
openaire +2 more sources
Summary: The purpose of this paper is to introduce a model to study structures which are widely present in public transportation networks. We show that, through hypergraphs, one can describe these structures and investigate the relation between their spectra. To this aim, we extend the structure of \((m,k)\)-stars on graphs to hypergraphs: the \((m,k)\)
openaire +2 more sources