In X-ray absorption spectroscopy, the K-edge is a sudden increase in x-ray absorption occurring when the energy of the X-rays is just above the binding...

graph is k-edge-connected if it remains connected whenever fewer than k edges are removed. The edge-connectivity of a graph is the largest k for which...

k-edge-choosable if every instance of list edge-coloring that has G as its underlying graph and that provides at least k allowed colors for each edge...

every edge of G and an edge for every pair of adjacent edges in G. A proper edge coloring with k different colors is called a (proper) k-edge-coloring...

tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together...

problem are the k-edge-connected Steiner network problem and the k-vertex-connected Steiner network problem, where the goal is to find a k-edge-connected graph...

mk be the number of k-edge matchings. One matching polynomial of G is ∑ k ≥ 0 m k x k . {\displaystyle \sum _{k\geq 0}m_{k}x^{k}.} Another definition...

two edges of the same color. An edge coloring with k colors is called a k-edge-coloring and is equivalent to the problem of partitioning the edge set...

excitation of a 1s electron occurs at the K-edge, while excitation of a 2s or 2p electron occurs at an L-edge (Figure 1). There are three main regions...

disconnected graph. A k-vertex-connected graph or k-edge-connected graph is a graph in which no set of k − 1 vertices (respectively, edges) exists that, when...

t""" if k == 0: return s == t if k == 1: return (s, t) in edges for u in vertices: if k_edge_path(s, u, floor(k / 2)) and k_edge_path(u, t, ceil(k / 2)):...

version: A graph is k-edge-connected (it remains connected after removing fewer than k edges) if and only if every pair of vertices has k edge-disjoint paths...

other color. A uniquely k-colorable graph G with n vertices has at least m ≥ (k−1)n − k(k−1)/2 edges. Equality holds when G is a (k−1)-tree. A minimal imperfect...

the object and can be separated from soft tissue, often referred to as K-edge imaging. In photon-counting mammography, contrast-enhanced imaging has been...

smallest edge cut disconnecting u from v. Again, local edge-connectivity is symmetric. A graph is called k-edge-connected if its edge connectivity is k or greater...

such as gadolinium (K edge at 50.2 keV), nanoparticle silver (K edge at 25.5 keV), zirconium (K edge at 18.0 keV), and gold (K edge at 80.7 keV). Some...

The Canny edge detector is an edge detection operator that uses a multi-stage algorithm to detect a wide range of edges in images. It was developed by...

energy of the K-shell electron in that atom cannot eject the K-shell electron. Siegbahn notation is used for notating absorption edges. In compound semiconductors...

is an even number, 2 k {\displaystyle 2k} . Then the edges of G {\displaystyle G} can be partitioned into k {\displaystyle k} edge-disjoint 2-factors....

Edge of Tomorrow is a 2014 American science fiction action film directed by Doug Liman and written by Christopher McQuarrie and the writing team of Jez...

An edge trimmer or lawn edger is a garden tool, either manual or motorised, to form distinct boundaries between a lawn, typically consisting of a grass...

theory, Yen's algorithm computes single-source K-shortest loopless paths for a graph with non-negative edge cost. The algorithm was published by Jin Y. Yen...

Adam Joseph Copeland (born October 30, 1973), better known by the ring name Edge, is a Canadian professional wrestler and actor. He is signed to All Elite...

Edge detection includes a variety of mathematical methods that aim at identifying edges, defined as curves in a digital image at which the image brightness...

trees.) A k-arboric graph is necessarily k-edge connected. The converse is not true. As a corollary of the Nash-Williams theorem, every 2k-edge connected...

not only makes it more intense than an electric-dipole forbidden metal K pre-edge (1s → 3d) transition, but also makes it more feature-rich as the lower...

Topics in condensed matter physics: the role of exchange in the lithium k edge and the fluorescence spectrum of heavily doped cadmium sulphide. His doctoral...

each edge, noting that a flow of k {\displaystyle k} in this graph corresponds, by the integral flow theorem, to k {\displaystyle k} pairwise edge-independent...

coordination environment, can make metal K-edge analysis less predictable. The most successful use of K and L-edge XAS provide valuable information on the...

systems of nodes or vertices connected in pairs by lines or edges. Contents:  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z See also References Square...