Results 41 to 50 of about 2,243,492 (285)
Majorana Fermions on Zigzag Edge of Monolayer Transition Metal Dichalcogenides [PDF]
, 2013 Majorana fermions, quantum particles with non-Abelian exchange statistics, are not only of fundamental importance, but also building blocks for fault-tolerant quantum computation.
Chu, Rui-Lin +5 more
core +2 more sources
Strong edge colorings of graphs
Discrete Mathematics, 1996 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
Strong List Edge Coloring of Subcubic Graphs
Mathematical Problems in Engineering, 2013 We study strong list edge coloring of subcubic graphs, and we prove that every subcubic graph with maximum average degree less than 15/7, 27/11, 13/5, and 36/13 can be strongly list edge colored with six, seven, eight, and nine colors, respectively.
Hongping Ma +4 more
openaire +1 more source
LPBoost with Strong Classifiers [PDF]
International Journal of Computational Intelligence Systems, 2010 The goal of boosting algorithm is to maximize the minimum margin on sample set. Based on minimax theory, the goal can be converted into minimize the maximum edge.
Yu K. Fang +3 more
doaj +1 more source
On Antimagic Labeling for Some Families of Graphs
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2023 Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct.
Noor K. Shawkat, Mohammed A. Ahmed
doaj +1 more source
Strong edge-colouring and induced matchings [PDF]
Information Processing Letters, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hocquard, Hervé +2 more
openaire +1 more source
Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities
, 2018 We consider the task of rendezvous in networks modeled as undirected graphs. Two mobile agents with different labels, starting at different nodes of an anonymous graph, have to meet.
Bouchard, Sébastien +3 more
core +3 more sources
Long-range molecular energy transfer mediated by strong coupling to plasmonic topological edge states [PDF]
NanophotonicsStrong coupling between light and molecular matter is currently attracting interest both in chemistry and physics, in the fast-growing field of molecular polaritonics. The large near-field enhancement of the electric field of plasmonic surfaces and their
Buendía Álvaro +4 more
doaj +2 more sources
A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs
Discussiones Mathematicae Graph Theory, 2017 The generalized k-connectivity κk(G) of a graph G, mentioned by Hager in 1985, is a natural generalization of the path-version of the classical connectivity. As a natural counterpart of this concept, Li et al.
Sun Yuefang
doaj +1 more source
Grünbaum colorings extended to non-facial 3-cycles
Electronic Journal of Graph Theory and Applications, 2022 We consider the question of when a triangulation with a Grünbaum coloring can be edge-colored with three colors such that the non-facial 3-cycles also receive all three colors; we will call this a strong Grünbaum coloring.
sarah-marie belcastro, Ruth Haas
doaj +1 more source