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...
10 KB (1,405 words) - 08:26, 24 June 2024
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...
7 KB (938 words) - 12:46, 5 July 2024
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...
44 KB (5,460 words) - 11:42, 17 August 2024
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...
65 KB (8,472 words) - 07:37, 16 July 2024
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...
3 KB (357 words) - 01:14, 21 May 2024
Matching (graph theory) (redirect from Matched edge)
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...
23 KB (2,938 words) - 07:47, 18 July 2024
Steiner tree problem (redirect from K-edge-connected steiner network problem)
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...
35 KB (4,388 words) - 13:27, 12 August 2024
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...
9 KB (1,093 words) - 01:40, 17 May 2024
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...
17 KB (2,062 words) - 20:41, 26 September 2024
Menger's theorem (section Edge connectivity)
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...
11 KB (1,598 words) - 04:43, 7 April 2024
Graph (discrete mathematics) (redirect from Edge-weighted graph)
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...
28 KB (3,689 words) - 20:15, 22 September 2024
Spectral imaging (radiography) (section K-edge imaging)
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...
45 KB (5,113 words) - 05:42, 9 August 2024
Uniquely colorable graph (redirect from Uniquely edge-colorable graph)
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...
10 KB (1,038 words) - 23:28, 23 September 2024
Graph coloring (redirect from K-vertex colorable)
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...
67 KB (7,996 words) - 16:56, 29 August 2024
The Ford Edge is a crossover SUV manufactured and marketed by the Ford Motor Company introduced for the 2007 model year as the first mid-size CUV marketed...
40 KB (3,255 words) - 00:45, 29 September 2024
Glossary of graph theory (redirect from Edge (graph theory))
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...
107 KB (15,799 words) - 11:44, 20 September 2024
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...
6 KB (786 words) - 12:41, 14 June 2024
Blade Runner 2: The Edge of Human (1995) is a science fiction novel by American writer K. W. Jeter. It is a continuation of both the film Blade Runner...
9 KB (1,205 words) - 14:45, 11 December 2023
assuming the left edge is 0 and right edge is 1, is S n ( x ) = { 0 , if x ≤ 0 x n + 1 ∑ k = 0 n ( n + k k ) ( 2 n + 1 n − k ) ( − x ) k , if 0 ≤ x ≤...
13 KB (2,454 words) - 16:10, 21 June 2024
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...
35 KB (5,067 words) - 00:20, 24 September 2024
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)):...
7 KB (1,038 words) - 12:53, 10 February 2024
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...
126 KB (11,052 words) - 23:53, 27 September 2024
tenure in WWE from 1998 to 2023, where he performed under the ring name Edge. Copeland is regarded as one of the greatest professional wrestlers of all...
222 KB (21,546 words) - 00:15, 1 October 2024
coefficient gets a peak yielding the fundamental edge. This occurs in the far infrared region of the spectrum. K-edge Siegbahn notation "The Penguin Dictionary...
2 KB (213 words) - 20:35, 6 September 2023
A k-uniform tiling is a tiling of tilings of the plane by convex regular polygons, connected edge-to-edge, with k types of vertices. The 1-uniform tiling...
71 KB (1,365 words) - 17:30, 22 September 2024
regular graph whose degree is an even number, 2k. Then the edges of G can be partitioned into k edge-disjoint 2-factors. Here, a 2-factor is a subgraph of...
3 KB (437 words) - 16:39, 28 September 2024
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...
24 KB (3,355 words) - 21:07, 21 September 2024
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...
15 KB (2,179 words) - 20:57, 30 June 2024
assigning each edge a capacity of 1 {\displaystyle 1} . In this network, the maximum flow is k {\displaystyle k} iff there are k {\displaystyle k} edge-disjoint...
41 KB (5,197 words) - 15:08, 8 September 2024
River's Edge is a 1986 American crime drama film directed by Tim Hunter, written by Neal Jimenez, and starring Crispin Glover, Keanu Reeves, Ione Skye...
22 KB (2,567 words) - 21:19, 17 September 2024