Results 41 to 50 of about 2,257,273 (319)
Clustering in complex networks. I. General formalism [PDF]
, 2006 We develop a full theoretical approach to clustering in complex networks. A key concept is introduced, the edge multiplicity, that measures the number of triangles passing through an edge.
G. Simmel +4 more
core +3 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
Coupling between Edge and Bulk in Strong-Field Quantum Dots
, 2002 The maximum-density-droplet (MDD) state of quantum-dot electrons becomes unstable at strong magnetic fields to the addition of interior holes. Using exact diagonalization, we demonstrate that the first hole is located at the center of the dot when the ...
MacDonald, A. H., Yang, S. -R. Eric
core +1 more source
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
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
Explicit substitution on the edge of strong normalization
Theoretical Computer Science, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bloo, C.J., Geuvers, J.H.
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT In pediatric patients, T‐cell lymphoblastic lymphoma (T‐LBL) survival exceeds 80%. Relapse remains associated with limited curative options. Frontline treatment is largely extrapolated from T‐cell acute lymphoblastic leukemia (T‐ALL) treatment, reflecting the ongoing debate, whether both entities represent distinct diseases or variants within ...
Marie C. Heider +4 more
wiley +1 more source