What people are saying - Write a review
We haven't found any reviews in the usual places.
Numerical aspects for nongeneric computations in control problems
Asymptotic Hypercube Embeddings of Dynamic Jfcary Trees
Antimagic Pickup Sticks by David Goorskey and Andrew Simoson
8 other sections not shown
adjacent antimagic bipartite graph cage clan common factor graph complete graphs computation configuration CONGRESSUS NUMERANTIUM 126 construct Corollary corresponding cubic graph cycles cyclic covering cyclic niche defined degree sequence denoted Diameter-Constrained MST elements embedding example exists Figure given graph G graph G(Sn Graph Theory grid graph Hence heuristic hexagonal host node hypercube hyperplane arrangement induced subgraph integers interlacing intersection intersection graphs isomorphism iterative refinement Join vertex Laplacian matrix layout algorithms least Lemma length Let G linear lines load MasPar Math matrix maximal clique mECC mixed graph naive placement neighbors niche graph nongeneric NP-complete nullspace number of leaves orthogonal pairs partition path player points polynomial position processor Proof quadric region labels result sign vector signed graphs singular values spanning tree stapled sequence sticks subset Theorem 3.2 transformation uncorrupted base undirected undirected graphs uniquely realizable V(fi vertices weight Wiener number wm(G zonotope