Results 31 to 40 of about 2,257,273 (319)
Statistical translation invariance protects a topological insulator from interactions [PDF]
We investigate the effect of interactions on the stability of a disordered, two-dimensional topological insulator realized as an array of nanowires or chains of magnetic atoms on a superconducting substrate.
Beenakker, C. W. J. +4 more
core +3 more sources
r-Strong edge colorings of graphs
If \(G\) is a graph and \(n\) a natural number, \(\chi(G,n)\) denotes the minimum number of colours required for a proper edge colouring of \(G\) in which no two vertices with distance at most \(n\) are incident to edges coloured with the same set of colours.
Akbari, S., Bidkhori, H., Nosrati, N.
openaire +2 more sources
Arsenene nanoribbon edge-resolved strong magnetism
Edge-resolved strong magnetism in arsenene nanoribbon is attributed to electron entrapment induced by edge bond contraction and potential deepening.
Sanmei Wang +3 more
openaire +3 more sources
Edge states in a strong magnetic field
9 pages, 3 figures available on request, LATEX, report IP-ASTP-16 ...
Bartos, I., Rosenstein, B.
openaire +2 more sources
A SURVEY INTUITIONISTIC FUZZY GRAPH [PDF]
I will begin with the presentation of the basic definitions required for the development of this survey- graph. Rosenfeld [5] first introduced the concept of fuzzy graphs. After that fuzzy graph theory becomes a vast research area. The first definition
Iuliana Carmen BĂRBĂCIORU +1 more
doaj
Superpixel Boundary-Based Edge Description Algorithm for SAR Image Segmentation
Although various methods can effectively segment synthetic aperture radar (SAR) images, we found that the method combining superpixel and image edge information can get better results. To solve the problem that common SAR image segmentation methods often
Ronghua Shang +4 more
doaj +1 more source
Enhanced spatial error concealment with directional entropy based interpolation switching [PDF]
This paper describes a spatial error concealment method that uses edge related information for concealing missing macroblocks in a way that not only preserves existing edges but also avoids introducing new strong ones.
Agrafiotis, D, Bull, DR, Canagarajah, CN
core +2 more sources
Upper Bounds for the Strong Chromatic Index of Halin Graphs
The strong chromatic index of a graph G, denoted by χ′s(G), is the minimum number of vertex induced matchings needed to partition the edge set of G. Let T be a tree without vertices of degree 2 and have at least one vertex of degree greater than 2.
Hu Ziyu, Lih Ko-Wei, Liu Daphne Der-Fen
doaj +1 more source
Strong edge colorings of graphs
The strong coloring number of a graph \(G\), \(\chi_s'(G)\), is the minimum number of colors for which there is a proper edge-coloring of \(G\) so that no two vertices are incident to edges having the same set of colors. (It is assumed that \(G\) has no isolated edges and at most one isolated vertex.) {Burris} and Schelp [J.
Favaron, Odile, Li, Hao, Schelp, R.H.
openaire +2 more sources
Soft X-ray absorption and fluorescence measurements are reported for the K-edge of B in MgB2. The measurements confirm a high density of B pxy(sigma)-states at the Fermi edge and extending to approximately 0.9 eV above the edge.
D. L. Ederer +9 more
core +1 more source

