scholarly journals On the edge spectrum of saturated graphs for paths and stars

2018 ◽  
Vol 89 (4) ◽  
pp. 364-385 ◽  
Author(s):  
Paul Balister ◽  
Ali Dogan
Keyword(s):  
Saturated Graphs ◽  
Edge Spectrum

The Edge Spectrum of $$K_4^-$$ K 4 - -Saturated Graphs

2018 ◽  
Vol 34 (6) ◽  
pp. 1723-1727
Author(s):  
Jun Gao ◽  
Xinmin Hou ◽  
Yue Ma
Keyword(s):  
Saturated Graphs ◽  
Edge Spectrum

m_Path Cover Saturated Graphs

2003 ◽  
Vol 13 ◽  
pp. 41-44 ◽  
Author(s):  
Aneta Dudek ◽  
Gyula Y. Katona ◽  
A.Pawel Wojda
Keyword(s):  
Saturated Graphs

Compressed Edge Spectrum Sensing: Extensions and practical considerations

2019 ◽  
Vol 67 (1) ◽  
pp. 51-59
Author(s):  
Edgar Beck ◽  
Carsten Bockelmann ◽  
Armin Dekorsy
Keyword(s):  
Wireless Communication ◽  
Spectrum Sensing ◽  
Industry 4.0 ◽  
Communication Systems ◽  
Sampling Rate ◽  
Wireless Communication Systems ◽  
Active Systems ◽  
Radio Systems ◽  
Edge Spectrum

Abstract Nowadays, spectrum in industrial radio systems is already overoccupied. Therefore, future Industry 4.0 applications require coexistence management of different wireless communication systems. For identification of active systems, we propose Compressed Edge Spectrum Sensing (CESS). Here, we focus on practical aspects and show that the sampling rate can still be highly reduced.

scholarly journals Fault Feature Vector Extraction Based on Edge Spectrum

2020 ◽  
Vol 455 ◽  
pp. 012012
Author(s):  
Pei Sheng ◽  
Taoer Li ◽  
Aiqiang Xu ◽  
Heng Li
Keyword(s):  
Feature Vector ◽  
Edge Spectrum

scholarly journals Few H copies in F ‐saturated graphs

2019 ◽  
Vol 94 (3) ◽  
pp. 320-348 ◽  
Author(s):  
Jürgen Kritschgau ◽  
Abhishek Methuku ◽  
Michael Tait ◽  
Craig Timmons
Keyword(s):  
Saturated Graphs

A Theorem on k-Saturated Graphs

1965 ◽  
Vol 17 ◽  
pp. 720-724 ◽  
Author(s):  
A. Hajnal
Keyword(s):  
Finite Graphs ◽  
Saturated Graphs ◽  
Finite Set ◽  
Multiple Edges

In this paper we consider finite graphs without loops and multiple edges. A graph is considered to be an ordered pair 〈G, *〉 where G is a finite set the elements of which are called the vertices of while * is a subset of [G]2 (where [G]2 is the set of all subsets of two elements of G). The elements of * are called the edges of . If {P, Q} ∊ *, we say that Q is adjacent to P. The degree of a vertex is the number of vertices adjacent to it. Let k be an integer. We say that is the complete k-graph if G has k elements and * = [G]2.

Multiple-scattering analysis ofK-edge x-ray-absorption near-edge spectrum of YBa2Cu3O7

1988 ◽  
Vol 38 (1) ◽  
pp. 244-251 ◽  
Author(s):  
K. B. Garg ◽  
A. Bianconi ◽  
S. Della Longa ◽  
A. Clozza ◽  
M. De Santis ◽  
...  
Keyword(s):  
Multiple Scattering ◽  
X Ray ◽  
Edge Spectrum ◽  
X Ray Absorption

Spin Properties of Quantum wells Incorporating Semimagnetic Semiconductors

2001 ◽  
Vol 690 ◽  
Author(s):  
N. Malkova ◽  
U. Ekenberg ◽  
L. Thylen
Keyword(s):  
Quantum Wells ◽  
Diluted Magnetic Semiconductor ◽  
Magnetic Semiconductor ◽  
Spin Splitting ◽  
Electronic Band ◽  
Spin Electronics ◽  
Edge Spectrum ◽  
Spin Properties ◽  
Diluted Magnetic ◽  
Splitting Effect

ABSTRACTThe electronic band-edge spectrum of magnetic semiconductor quantumwells containing a diluted magnetic semiconductor as one of the constituents is studied within the envelope-function formalism. Quantum wells with normal and mutually inverted band arrangements are considered. The sp – d hydribization between the bare sp-electron states and the d-states of the Mn atoms is shown to lead to a spin-splitting effect. The spin-splitting effect is studied as a function of external magnetic field, well width, valence band offset and fraction of magnetic atoms. The results have bearing on the perspective for using the magnetic semicondutor structures in spin electronics.

Sign in / Sign up

Export Citation Format

Share Document