Übersetzung für 'k edge connected' von Englisch nach Deutsch

k-edge-connected {adj}

k-fach kantenzusammenhängendmath.

---

K-edge filter

K-Kantenfilter {m} [fachspr. meist {n}]MedTech.

Werbung

knit [knit stitch] <k, K>

rechte Masche {f} <re M>textil.

knit stitch <k, K>

rechte Masche {f} <re M>textil.

sodium-potassium pump <Na-K pump, Na/K pump>

Na-K-Pumpe {f}med.

edge-to-edge bite

gerader Biss {m}dent.

Zangenbiss {m}dent.

Kantenbiss {m}dent.

Kopfbiss {m}dent.

Kock pouch <k-pouch, K-pouch>

Kock-Pouch {m} <K-Pouch>med.

connected {adj}

zusammenhängendmath.

zusammengehörig

connected {adj} {past-p}

angebunden [verbunden]

verbunden

beschaltetelectr.

angeschlossen

geklemmt [angeschlossen]electr.tech.

parallel-connected {adj}

parallel geschaltetelectr.

connected with

verwickelt in

series-connected {adj}

in Serie geschaltetelectr.

connected arrangement

Verbindungs­anlage {f}

• Nash-Williams also studied k-edge-connected graphs, Hamiltonian cycles in dense graphs, versions of the reconstruction conjecture for infinite graphs, and the theory of quasi-orders.
• Other generalizations of the Steiner tree 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 or a "k"-vertex-connected graph rather than any connected graph.
• A "k-vertex-connected graph" or "k-edge-connected graph" is a graph in which no set of [...] vertices (respectively, edges) exists that, when removed, disconnects the graph.
• A graph is "k"-vertex-connected if the removal of any ("k" &minus; 1) vertices leaves a connected subgraph, and "k"-edge-connected if the removal of any ("k" &minus; 1) edges leaves a connected subgraph.
• If subgraph [...] is connected for all [...] where [...] , then "G" is "k"-edge-connected.