Find link

language:

Find link is a tool written by Edward Betts.

searching for K-edge 79 found (92 total)

alternate case: k-edge

Minimum spanning tree (5,460 words) [view diff] no match in snippet view article find links to article

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

K-edge-connected graph (938 words) [view diff] exact match in snippet view article find links to article

In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed. The edge-connectivity of a graph

Edge coloring (8,472 words) [view diff] exact match in snippet view article find links to article

different colors is called a (proper) k-edge-coloring. A graph that can be assigned a k-edge-coloring is said to be k-edge-colorable. The smallest number of

Steiner tree problem (4,388 words) [view diff] exact match in snippet view article find links to article

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

List edge-coloring (388 words) [view diff] exact match in snippet view article find links to article

is proper if no two adjacent edges receive the same color. A graph G is k-edge-choosable if every instance of list edge-coloring that has G as its underlying

Spectral imaging (radiography) (5,113 words) [view diff] no match in snippet view article

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

Savitch's theorem (1,038 words) [view diff] no match in snippet view article find links to article

of any length exists from s to t""" return k_edge_path(s, t, n) # n is the number of vertices def k_edge_path(s, t, k) -> bool: """Test whether a path

KKED (590 words) [view diff] no match in snippet view article find links to article

(1997–1998) Former frequencies 104.9 MHz (1962–1968) Call sign meaning K K EDge (former branding) Technical information Licensing authority FCC Facility

Menger's theorem (1,598 words) [view diff] exact match in snippet view article find links to article

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

Actinocene (580 words) [view diff] exact match in snippet view article find links to article

(2014). "New evidence for 5f covalency in actinocenes determined from carbon K-edge XAS and electronic structure theory". Chem. Sci. 5 (1): 351–359. doi:10

Steven Girvin (961 words) [view diff] no match in snippet view article find links to article

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

Dibromine monoxide (226 words) [view diff] exact match in snippet view article find links to article

(January 1990). "Characterization of dibromine monoxide (Br2O) by bromine K-edge EXAFS and IR spectroscopy". Journal of the American Chemical Society. 112

Matching (graph theory) (2,938 words) [view diff] exact match in snippet view article

function of the number of k-edge matchings in a graph is called a matching polynomial. Let G be a graph and mk be the number of k-edge matchings. One matching

Robert Hofstadter (1,163 words) [view diff] exact match in snippet view article find links to article

Research, Air Force Research Laboratory, (October 1964). Hofstadter, R. "K-edge Subtraction Angiography with Synchrotron X-Rays: Final Technical Report

K-vertex-connected graph (773 words) [view diff] exact match in snippet view article find links to article

least 16 k {\displaystyle 16k} , then it is k {\displaystyle k} -linked. k-edge-connected graph Connectivity (graph theory) Menger's theorem Structural

Lapis lazuli (3,006 words) [view diff] exact match in snippet view article find links to article

to ultramarine blue: investigating Cennino Cennini's recipe using sulfur K-edge XANES". Pure and Applied Chemistry. 90 (3): 463–475. doi:10.1515/pac-2017-0502

Connectivity (graph theory) (2,062 words) [view diff] exact match in snippet view article

from v. Again, local edge-connectivity is symmetric. A graph is called k-edge-connected if its edge connectivity is k or greater. A graph is said to be

Stagnosol (612 words) [view diff] exact match in snippet view article find links to article

(2010). "Phosphorus speciation of forest-soil organic surface layers using P K-edge XANES spectroscopy". Journal of Plant Nutrition and Soil Science. 173 (6):

Camille Jordan (431 words) [view diff] exact match in snippet view article find links to article

Jordan–Schur theorem Jordan–Schönflies theorem Bounded variation Homotopy group k-edge-connected graph Total variation Scientific career Fields Mathematics Academic

Graph (discrete mathematics) (3,689 words) [view diff] exact match in snippet view article

Otherwise it is called a disconnected graph. A k-vertex-connected graph or k-edge-connected graph is a graph in which no set of k − 1 vertices (respectively

Leaching (agriculture) (1,350 words) [view diff] exact match in snippet view article

manure-amended soil profile – Evidence from wet chemical extraction, 31P-NMR and P K-edge XANES spectroscopy. Geoderma 322, 19–27. doi:10.1016/j.geoderma.2018.01

Photon-counting mammography (2,665 words) [view diff] exact match in snippet view article find links to article

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

Uniquely colorable graph (1,038 words) [view diff] exact match in snippet view article find links to article

subgraph. A uniquely edge-colorable graph is a k-edge-chromatic graph that has only one possible (proper) k-edge-coloring up to permutation of the colors.

Rhodium (3,863 words) [view diff] exact match in snippet view article find links to article

C P; et al. (1984). "Optimum x-ray spectra for mammography: choice of K-edge filters for tungsten anode tubes". Phys. Med. Biol. 29 (3): 249–52. Bibcode:1984PMB

Nash-Williams theorem (464 words) [view diff] exact match in snippet view article find links to article

applies to forests rather than trees.) A k-arboric graph is necessarily k-edge connected. The converse is not true. As a corollary of NW, every 2k-edge

Radiocontrast agent (1,435 words) [view diff] exact match in snippet view article find links to article

diagnostic radiography. When the incident x-ray energy is closer to the k-edge of the atom it encounters, photoelectric absorption is more likely to occur

2-factor theorem (502 words) [view diff] no match in snippet view article find links to article

edges of G {\displaystyle G} can be partitioned into k {\displaystyle k} edge-disjoint 2-factors. Here, a 2-factor is a subgraph of G {\displaystyle

HMS Vernon (shore establishment) (1,721 words) [view diff] no match in snippet view article

1967 Captain William P. B. Barber, July 1967 – April 1969 Captain Thomas K. Edge-Partington, April 1969 – October 1970 Captain Stuart M.W. Farquharson-Roberts

Attosecond (1,142 words) [view diff] exact match in snippet view article find links to article

Chang, Zenghu (4 August 2017). "53-attosecond X-ray pulses reach the carbon K-edge". Nature Communications. 8 (1): 186. Bibcode:2017NatCo...8..186L. doi:10

Iron–sulfur protein (2,508 words) [view diff] case mismatch in snippet view article find links to article

Hedman, Britt; Solomon, Edward I. (2010-08-20). "Solvation Effects on S K-Edge XAS Spectra of Fe−S Proteins: Normal and Inverse Effects on WT and Mutant

Phi bond (356 words) [view diff] exact match in snippet view article find links to article

(2014). "New evidence for 5f covalency in actinocenes determined from carbon K-edge XAS and electronic structure theory". Chem. Sci. 5 (1): 351–359. doi:10

Cograph (2,717 words) [view diff] exact match in snippet view article find links to article

tractable. Deciding if a graph can be k-edge-deleted to a cograph can be solved in O*(2.415k) time, and k-edge-edited to a cograph in O*(4.612k). If the

SpiderTech–C10 (424 words) [view diff] case mismatch in snippet view article find links to article

DZ-Nuts, Finishline, Giro, Gu, HerbaLife, Hutchinson, Humberview Group, ISM, K-Edge, Oakley, Park Tool, Pearl Izumi, PRO, Shimano, Thule "Spidertech Powered

Edward I. Solomon (1,336 words) [view diff] exact match in snippet view article find links to article

study non-heme iron enzyme active sites Development of metal L-edge, ligand K-edge x-ray absorption spectroscopy and resonant inelastic x-ray scattering to

Crispin Nash-Williams (593 words) [view diff] exact match in snippet view article find links to article

because of its implications in matroid theory. Nash-Williams also studied k-edge-connected graphs, Hamiltonian cycles in dense graphs, versions of the reconstruction

Nickel (9,837 words) [view diff] case mismatch in snippet view article find links to article

R. K.; Bryngelson, P. A.; Maroney, M. J.; Hedman, B.; et al. (2004). "S K-Edge X-ray Absorption Spectroscopic Investigation of the Ni-Containing Superoxide

DMSO reductase (1,483 words) [view diff] exact match in snippet view article find links to article

bis-dithiolene complexes suggest that be oxygen-transfer, electron transfer. Using S K-edge XAS and DFT, these model studies point to concerted S-O scission and electron

Maya blue (1,382 words) [view diff] exact match in snippet view article find links to article

Eeckhout; T. Neisius; P. Martinetto; E. Dooryhée; C. Reyes-Valerio (2005). "Fe K-edge XANES of Maya blue pigment". Nuclear Instruments and Methods in Physics

Derailleur (3,979 words) [view diff] case mismatch in snippet view article find links to article

Retrieved 2010-07-12. Zack Vestal (Apr 14, 2009). "Born for Beijing, the K-Edge chain catcher goes into production". VeloNews. Archived from the original

Kristin Armstrong (2,252 words) [view diff] case mismatch in snippet view article find links to article

January 21, 2020. Vestal, Zack (April 14, 2009). "Born for Beijing, the K-Edge chain catcher goes into production". Velonews. Archived from the original

Kristin Armstrong (2,252 words) [view diff] case mismatch in snippet view article find links to article

January 21, 2020. Vestal, Zack (April 14, 2009). "Born for Beijing, the K-Edge chain catcher goes into production". Velonews. Archived from the original

Arsenic contamination of groundwater (5,103 words) [view diff] case mismatch in snippet view article find links to article

Arsenic from Synthetic Groundwater with Iron Electrocoagulation: An Fe and As K-Edge EXAFS Study". Environmental Science & Technology. 46 (2): 986–994. Bibcode:2012EnST

X-ray birefringence imaging (476 words) [view diff] exact match in snippet view article find links to article

carried out using incident linearly polarized X-rays tuned to the bromine K-edge). Applications of the technique have included the study of changes in molecular

Silver molybdate (1,214 words) [view diff] exact match in snippet view article find links to article

Mustarelli, P; Tomasi, C; Magistris, A (1999-06-01). "XANES and EXAFS at Mo K-edge in (AgI)1−x(Ag2MoO4)x glasses and crystals". Solid State Ionics. 121 (1–4):

Bicircular matroid (893 words) [view diff] exact match in snippet view article find links to article

_{k=0}^{n}(-1)^{k}f_{k}(\lambda -1)^{n-k},} where fk equals the number of k-edge spanning forests in G. See Zaslavsky (1982). Bicircular matroids, like all

Graph coloring (8,081 words) [view diff] exact match in snippet view article find links to article

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 into

Regular complex polygon (1,846 words) [view diff] exact match in snippet view article find links to article

a graph, while forms with k-edges can only be related by hypergraphs. A k-edge can be seen as a set of vertices, with no order implied. They may be drawn

Inductively coupled plasma mass spectrometry (6,588 words) [view diff] exact match in snippet view article find links to article

by laser ablation inductively coupled plasma-mass spectrometry and x-ray K-edge densitometry of forensic samples.Graduate Theses and Dissertations. Paper

Vision West Nottinghamshire College (2,218 words) [view diff] no match in snippet view article find links to article

the rear of the Technical College, was officially opened by Mr. T. L. K. Edge" Retrieved 31 December 2013 [4] 'Our Mansfield and Area' website administered

Trivially perfect graph (1,189 words) [view diff] no match in snippet view article find links to article

trivially perfect graph, in linear time. Determining if a general graph is k edge deletions away from a trivially perfect graph is NP-complete, fixed-parameter

Glossary of graph theory (15,920 words) [view diff] exact match in snippet view article find links to article

graphs (removing fewer than k vertices cannot disconnect the graph), and k-edge-connected graphs (removing fewer than k edges cannot disconnect the graph)

Matching polynomial (882 words) [view diff] exact match in snippet view article find links to article

been defined. Let G be a graph with n vertices and let mk be the number of k-edge matchings. One matching polynomial of G is m G ( x ) := ∑ k ≥ 0 m k x k

Herschel graph (1,617 words) [view diff] no match in snippet view article find links to article

a graph is k {\displaystyle k} -vertex-connected or k {\displaystyle k} -edge-connected if the removal of fewer than k {\displaystyle k} vertices or

S. Samar Hasnain (1,765 words) [view diff] exact match in snippet view article find links to article

287–292. doi:10.1038/nsb0495-287. PMID 7796265. S2CID 21986822. Vanadium K-edge X-ray absorption spectrum of the VFe protein of the vanadium nitrogenase

PARATEC (187 words) [view diff] no match in snippet view article find links to article

near-edge structure calculations with the pseudopotentials: Application to the K edge in diamond and α-quartz". Physical Review B. 66 (19). American Physical

Maximum flow problem (5,227 words) [view diff] no match in snippet view article find links to article

the maximum flow is k {\displaystyle k} iff there are k {\displaystyle k} edge-disjoint paths. 2. The paths must be independent, i.e., vertex-disjoint

Operando spectroscopy (3,602 words) [view diff] exact match in snippet view article find links to article

cell (SOFC) operation at mid- and low-range temperatures in an operando S K-edge XANES have been studied. Ni is a typical catalyst material for the anode

Claw-free graph (3,622 words) [view diff] exact match in snippet view article find links to article

has a k-factor; and, if a claw-free graph is (2k + 1)-connected, then any k-edge matching can be extended to a perfect matching. An independent set in a

Serena DeBeer (2,544 words) [view diff] case mismatch in snippet view article find links to article

"Localized Electronic Structure of Nitrogenase FeMoco Revealed by Selenium K-Edge High Resolution X-ray Absorption Spectroscopy". Journal of the American

Ear decomposition (1,913 words) [view diff] exact match in snippet view article find links to article

if the removal of any (k − 1) vertices leaves a connected subgraph, and k-edge-connected if the removal of any (k − 1) edges leaves a connected subgraph

Charge sharing (706 words) [view diff] exact match in snippet view article find links to article

pixel size. Furthermore, fluorescence of the detector material above its K-edge can lead to additional charge carriers that add to the effect of charge-sharing

Strong orientation (1,855 words) [view diff] exact match in snippet view article find links to article

that every 2k-edge-connected undirected graph can be oriented to form a k-edge-connected directed graph. A totally cyclic orientation of a graph G is an

Yen's algorithm (2,179 words) [view diff] no match in snippet view article find links to article

i} -th node, then ( i ) k − ( i + 1 ) k {\displaystyle (i)^{k}-(i+1)^{k}} edge is different from any path in A j {\displaystyle A^{j}} , where j {\displaystyle

Photon-counting computed tomography (2,568 words) [view diff] exact match in snippet view article find links to article

1088/0031-9155/21/5/002. PMID 967922. S2CID 250824716. Roessl E, Proksa R (August 2007). "K-edge imaging in x-ray computed tomography using multi-bin photon counting detectors"

Kate Kirby (1,166 words) [view diff] exact match in snippet view article find links to article

(1998-11-28). "Photoabsorption of atomic oxygen in the vicinity of the K-edge". Journal of Physics B: Atomic, Molecular and Optical Physics. 31 (22):

Carol J. Burns (616 words) [view diff] exact match in snippet view article find links to article

for d- and f-element metallocene dichlorides identified using chlorine K-edge X-ray absorption spectroscopy and time-dependent density functional theory"

Inverted ligand field theory (2,935 words) [view diff] exact match in snippet view article find links to article

assignment of this oxidation state. Using UV/visible/near IR spectroscopy, Cu K-edge X-ray absorption spectroscopy, and 1s2p resonant inelastic X-ray scattering

Resonant high harmonic generation from laser ablated plasma plumes (1,103 words) [view diff] exact match in snippet view article find links to article

PMID 10054556. Jie, Li (2017). "53-attosecond X-ray pulses reach the carbon K-edge". Nature Communications. 8 (1): 186. Bibcode:2017NatCo...8..186L. doi:10

George Crabtree (2,201 words) [view diff] case mismatch in snippet view article find links to article

Soonjeong; Pan, Baofei; Liao, Chen; Vaughey, John (2016). "Utilization of Ca K-Edge X-ray Absorption Near Edge Structure to Identify Intercalation in Potential

Sparsity matroid (3,454 words) [view diff] no match in snippet view article find links to article

are equivalent to graphs that can be decomposed into k {\displaystyle k} edge-disjoint spanning trees, called k {\displaystyle k} -arborescences. A (

Rook polynomial (3,630 words) [view diff] exact match in snippet view article find links to article

matching polynomial, which is the generating function of the number of k-edge matchings in a graph. The rook polynomial Rm,n(x) corresponds to the complete

Barbara Cade-Menun (827 words) [view diff] exact match in snippet view article find links to article

methods such as 31P nuclear magnetic resonance spectroscopy (P-NMR) and P k-edge X-ray absorption near-edge structure spectroscopy (P-XANES). These techniques

Community search (1,093 words) [view diff] exact match in snippet view article find links to article

communities. The commonly used metrics are k-core (minimum degree), k-truss, k-edge-connected, etc. Among these measures, the k-core metric is the most popular

Marcetta Y. Darensbourg (3,518 words) [view diff] case mismatch in snippet view article find links to article

; Hodgson, Keith O.; Hedman, Britt; Solomon, Edward I. (2011-01-17). "S K-Edge X-Ray Absorption Spectroscopy and Density Functional Theory Studies of High

Murburn concept (4,997 words) [view diff] exact match in snippet view article find links to article

03.003. PMID 26969799. Reina RG, Leri AC, Myneni SC (February 2004). "Cl K-edge X-ray spectroscopic investigation of enzymatic formation of organochlorines

Caterina Vozzi (621 words) [view diff] exact match in snippet view article find links to article

elements. X-ray measurements near specific absorption edges (e.g. the Carbon K-edge) provides information of the structural and electronic environment of atoms

Linda Young (scientist) (2,381 words) [view diff] no match in snippet view article

Krässig, B.; Landahl, E. C.; Peterson, E. R.; Rudati, J. (2007-10-24). "$K$-edge x-ray-absorption spectroscopy of laser-generated ${\text{Kr}}^{+}$ and

Carbonate-associated sulfate (5,673 words) [view diff] exact match in snippet view article find links to article

using X-ray absorption near-edge structure (XANES) spectroscopy at the S K-edge". American Mineralogist. 90 (11–12): 1748–1758. Bibcode:2005AmMin..90.1748D

Brandes' algorithm (1,696 words) [view diff] no match in snippet view article find links to article

centrality, including betweenness with paths at most length k {\displaystyle k} , edge betweenness, load betweenness, and stress betweenness. Brandes, Ulrik